zoukankan      html  css  js  c++  java
  • Codeforces Round #402 (Div. 2) A

    Description

    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

    题意:交换两个组的学生,使得两个组的分数相同。

    解法:自然需要符合一个分数出现次数为偶数,如果出现奇数不能平分。

    然后计算两个组出现相同分数之差除以2,求得和/2就是结果

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 #define  ll long long
     4 int maxn=200;
     5 int a[200],b[200];
     6 map<int,int>p,q;
     7 int main()
     8 {
     9     int n;
    10     cin>>n;
    11     for(int i=1;i<=n;i++)
    12     {
    13         cin>>a[i];
    14         q[a[i]]++;
    15     }
    16     for(int i=1;i<=n;i++)
    17     {
    18         cin>>b[i];
    19         p[b[i]]++;
    20     }
    21     int ans=0;
    22     for(int i=1;i<=5;i++)
    23     {
    24         if((p[i]+q[i])%2)
    25         {
    26             cout<<"-1";
    27             return 0;
    28         }
    29         else
    30         {
    31             ans+=abs(p[i]-q[i])/2;
    32         }
    33     }
    34     cout<<ans/2<<endl;
    35     return 0;
    36 }
  • 相关阅读:
    Ubuntu下官方QQ崩溃的解决
    [转]PHP函数的实现原理及性能分析
    [收藏的资料]301重定向的实现方法
    手动配置Ubuntu 指定DNS服务器地址
    C# FTP操作类
    vs2010 快捷键大全
    分享一个不错的VS插件——CodeMap
    C# 快速的批量修改重命名.net程序的命名空间(一)转 tianyaxiang
    jquery 的 ajax 程序 简单的
    winform窗体间传值
  • 原文地址:https://www.cnblogs.com/yinghualuowu/p/6457903.html
Copyright © 2011-2022 走看看