Codeforces Round #402 (Div. 2) A题
来源:互联网 发布:安卓手机仿windows桌面 编辑:程序博客网 时间:2024/05/01 16:56
In Berland each high school student is characterized by academic performance — integer value between 1 and 5.
In high school 0xFF there are two groups of pupils: the group A and the group B. Each group consists of exactly n students. An academic performance of each student is known — integer value between 1 and 5.
The school director wants to redistribute students between groups so that each of the two groups has the same number of students whose academic performance is equal to 1, the same number of students whose academic performance is 2 and so on. In other words, the purpose of the school director is to change the composition of groups, so that for each value of academic performance the numbers of students in both groups are equal.
To achieve this, there is a plan to produce a series of exchanges of students between groups. During the single exchange the director selects one student from the class A and one student of class B. After that, they both change their groups.
Print the least number of exchanges, in order to achieve the desired equal numbers of students for each academic performance.
The first line of the input contains integer number n (1 ≤ n ≤ 100) — number of students in both groups.
The second line contains sequence of integer numbers a1, a2, ..., an (1 ≤ ai ≤ 5), where ai is academic performance of the i-th student of the group A.
The third line contains sequence of integer numbers b1, b2, ..., bn (1 ≤ bi ≤ 5), where bi is academic performance of the i-th student of the group B.
Print the required minimum number of exchanges or -1, if the desired distribution of students can not be obtained.
4
5 4 4 4
5 5 4 5
1
6
1 1 1 1 1 1
5 5 5 5 5 5
3
1
5
3
-1
9
3 2 5 5 2 3 3 3 2
4 1 4 1 1 2 4 4 1
4
#include<cstdio>#include<cstring>#include<algorithm>using namespace std; int a[105],b[105]; int na[10],nb[10];int ch[10];int main(){ int n; scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",&a[i]); na[a[i]]++; } for(int i=1;i<=n;i++){ scanf("%d",&b[i]); nb[b[i]]++; } int flag=1; int sum=0; for(int i=1;i<=5;i++){ int t=na[i]+nb[i]; if(t&1) flag=0; ch[i]=na[i]-nb[i]; sum+=ch[i]; } if(flag==0){ puts("-1"); }else{ if(sum!=0) puts("-1"); else{ int ans=0; for(int i=1;i<=5;i++) if(ch[i]<0) ans-=ch[i]/2;else ans+=ch[i]/2; printf("%d\n",ans/2); } } return 0;}
- Codeforces Round #402 (Div. 2) A题
- 【codeforces】Round #402 Div.2 A
- Codeforces Round #402 (Div. 2) A+B
- Codeforces Round #181 (Div. 2) A题
- Codeforces Round #184 (Div. 2) A题
- Codeforces Round #172 (Div. 2) A题
- Codeforces Round #166 (Div. 2) A题
- Codeforces Round #132 (Div. 2) A题
- Codeforces Round #131 (Div. 2) A题
- Codeforces Round #133 (Div. 2) A题
- Codeforces Round #137 (Div. 2) A题
- Codeforces Round #138 (Div. 2) A题
- Codeforces Round #147 (Div. 2) A题
- Codeforces Round #141 (Div. 2) A题
- Codeforces Round #143 (Div. 2) A题
- Codeforces Round #135 (Div. 2) A题
- Codeforces Round #163 (Div. 2) A题
- Codeforces Round #146 (Div. 2) A题
- CppPrimer--顶层const与底层const
- linux网络编程之用select函数实现io复用(基于TCP)引发的思考
- PyCharm 使用 tricks
- python AES对称加密示例
- 学习算法(3)——查找2个数组中的相同元素
- Codeforces Round #402 (Div. 2) A题
- Spark聚类模型K-Means----来源Spark机器学习
- python爬虫设置请求消息头(headers)
- CppPrimer--数组名与指针& 函数名与函数指针
- 95. Unique Binary Search Trees II
- Android-TextView及其子类(TextView、EditText、Button)
- 随记
- Android事件传递机制
- 解决Python的print中文在windows命令行乱码问题