思维题-Pupils Redistribution

题目

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 a₁, a₂, ..., a_n (1 ≤ a_i ≤ 5), where a_i is academic performance of the i-th student of the group A.

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

Example

只要二行的数字有一个数字的个数为奇数 就不可能通过交换达成条件 可以直接输出-1

要求第一行的数字和第二行的数字相同的数字个数也相同 所以遍历第一行和第二行计算出每种

数字的个数然后 第一行该数字的个数减去第二行该数字的个数的绝对值再除以2就是把该数字调好

应该交换的次数，因为交换是同时交换2个数，所以是两个数字同时被交换，一次交换换了两个数

应该再一次除以2

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cmath>
 4 
 5 using namespace std;
 6 
 7 int cnt1[10];
 8 int cnt2[10];
 9 int main()
10 {
11     int n;scanf("%d",&n);
12     for(int i=0;i<n;i++)
13     {
14         int temp;
15         scanf("%d",&temp);
16         cnt1[temp]++;
17     }
18     for(int i=0;i<n;i++)
19     {
20         int temp;
21         scanf("%d",&temp);
22         cnt2[temp]++;
23     }
24     for(int i=1;i<=5;i++)
25     {
26         if((cnt1[i]+cnt2[i])%2 == 1)//若个数为奇数 直接输出-1
27         {
28             printf("-1\n");
29             return 0;
30         }
31     }
32     int ans = 0;
33     for(int i=1;i<=5;i++)
34     {
35         ans += abs(cnt1[i]-cnt2[i])/2; //算出数字i的第一行个数和第二行个数的差 除以2 是需要交换的次数
36     }
37     printf("%d\n",ans/2); //输出答案 除以2是因为一次交换数字可以换两个 相当于上一步多算了一次交换 
38     return 0;
39 }

 

转载于:https://www.cnblogs.com/16-CHQ/p/6506158.html