交换元素使两个数组相同

最新推荐文章于 2023-11-13 23:35:24 发布

原创最新推荐文章于 2023-11-13 23:35:24 发布 · 1.4k 阅读

2 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#IT #ACM #训练

ACM训练专栏收录该内容

7 篇文章

订阅专栏

In Berland each high school student is characterized byacademic performance — integer value between1 and 5.

In high school 0xFF there are two groups of pupils: the groupA and the group B. Each group consists of exactlyn students. An academic performance of each student is known — integer value between1 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 to1, the same number of students whose academic performance is2 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 classA 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 numbern (1 ≤ n ≤ 100) — number of students in both groups.

The second line contains sequence of integer numbersa₁, a₂, ..., a_n (1 ≤ a_i ≤ 5), where a_i is academic performance of thei-th student of the group A.

The third line contains sequence of integer numbersb₁, b₂, ..., b_n (1 ≤ b_i ≤ 5), where b_i is academic performance of thei-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.

Example

Input

4
5 4 4 4
5 5 4 5

Output

Input

6
1 1 1 1 1 1
5 5 5 5 5 5

Output

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

source：点击打开链接

题意：通过交换元素使得两个数组中相同元素出现的次数相同，求最少交换的次数

解析：如果某个元素的个数为奇数时是做不到的，只有当所有的元素为偶数个时，将两个数组中相同元素个数的差除以2，总和 再除以2就是最终答案。

代码：

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int main(void)
{
    int a[101],b[101],p[6],q[6];
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        int ans=0;
        bool flag=true;
        memset(p,0,sizeof(p));
        memset(q,0,sizeof(q));
        for(int i=0; i<n; i++)
        {
            scanf("%d",&a[i]);
            p[a[i]]++;
        }
        for(int i=0; i<n; i++)
        {
            scanf("%d",&b[i]);
            q[b[i]]++;
        }
        for(int i=1; i<=5; i++)
        {
            if((p[i]+q[i])&1)
            {
                flag=false;
                printf("-1\n");
                break;
            }
            else
                ans+=abs(p[i]-q[i])>>1;
        }
        if(flag)
            printf("%d\n",ans>>1);
    }
    return 0;
}