codeforces contest 779 A题

A. Pupils Redistribution
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Input
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.

Output
Print the required minimum number of exchanges or -1, if the desired distribution of students can not be obtained.

Examples
input
4
5 4 4 4
5 5 4 5
output
1
input
6
1 1 1 1 1 1
5 5 5 5 5 5
output
3
input
1
5
3
output
-1
input
9
3 2 5 5 2 3 3 3 2
4 1 4 1 1 2 4 4 1
output
4

题意：给你等长度的两组数，问你能不能通过交换两组数的某些数，使得两组数中的出现的过的数的个数相等，如果能，求出最小的交换次数，如果不能，输出-1。

解题思路：先把两组数中所有出现过的数统计一下个数，如果有一个数的个数为奇数，则不能，因为要分为两组，两边又要相等，所有必须为偶数，然后把每个数的个数分一半出来组成一个新的数组，这个新的数组就是最后两个数组交换完毕之后的状态数组，比较一下不同的个数就行。

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1000;
int n;
int a[maxn];
int b[maxn];
int c[maxn];
int sum[maxn];
int main()
{
    while(~scanf("%d",&n))
    {
        memset(sum,0,sizeof(sum));
        for(int i = 1; i <= n; i++)
        {
            scanf("%d",&a[i]);
            sum[a[i]]++;
        }
        for(int i = 1; i <= n; i++)
        {
            scanf("%d",&b[i]);
            sum[b[i]]++;
        }
        bool flag = true;
        int loc = 1;
        for(int i = 1; i <= 5; i++)
        {
            if(sum[i]&1)
            {
                flag = false;
                break;
            }
            int j;
            for(j = loc; j <= loc + sum[i]/2 - 1; j++)
            {
                c[j] = i;
            }
            loc = j;
        }
        if(!flag)
        {
            printf("-1\n");
            continue;
        }
        sort(a + 1,a + n + 1);
        sort(c + 1,c + n + 1);
        int ans = 0;
        int term1[10];
        int term2[10];
        memset(term1,0,sizeof(term1));
        memset(term2,0,sizeof(term2));
        for(int i = 1; i <= n; i++)
        {
            term1[a[i]]++;
        }
        for(int i = 1; i <= n; i++)
        {
            term2[c[i]]++;
        }
        for(int i = 1; i <= 5; i++)
        {
            ans += abs(term1[i] - term2[i]);
        }
        printf("%d\n",ans/2);
    }
    return 0;
}