Codeforces 2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest I题（模拟）

最新推荐文章于 2018-10-24 18:31:49 发布

原创最新推荐文章于 2018-10-24 18:31:49 发布 · 746 阅读

0 ·

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

CF 专栏收录该内容

67 篇文章

订阅专栏

本文介绍了一个关于彩票公平化的算法问题，旨在确保每位参与者有平等的中奖机会。通过统计不同颜色球的数量，找出最少需要重新涂色的球数，使每种颜色的球数量相等。

I. Lottery
time limit per test
2 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

Today Berland holds a lottery with a prize — a huge sum of money! There are k persons, who attend the lottery. Each of them will receive a unique integer from 1 to k.

The organizers bought n balls to organize the lottery, each of them is painted some color, the colors are numbered from 1 to k. A ball of color c corresponds to the participant with the same number. The organizers will randomly choose one ball — and the winner will be the person whose color will be chosen!

Five hours before the start of the lottery the organizers realized that for the lottery to be fair there must be an equal number of balls of each of k colors. This will ensure that the chances of winning are equal for all the participants.

You have to find the minimum number of balls that you need to repaint to make the lottery fair. A ball can be repainted to any of the k colors.
Input

The first line of the input contains two integers n and k (1 ≤ k ≤ n ≤ 100) — the number of balls and the number of participants. It is guaranteed that n is evenly divisible by k.

The second line of the input contains space-separated sequence of n positive integers ci (1 ≤ ci ≤ k), where ci means the original color of the i-th ball.
Output

In the single line of the output print a single integer — the minimum number of balls to repaint to make number of balls of each color equal.
Sample test(s)
Input
4 2
2 1 2 2
Output
1
Input
8 4
1 2 1 1 1 4 1 4
Output
3
Note
In the first example the organizers need to repaint any ball of color 2 to the color 1.

In the second example the organizers need to repaint one ball of color 1 to the color 2 and two balls of the color 1 to the color 3.

题意：给你n个数，要他们组成m对（每一对是数字相同），问至少改变几个数

解法：直接统计

#include<bits/stdc++.h>
using namespace std;
const int maxn=113;
const int inf=1<<27;
#define LL long long
#define P pair<int,int>
#define X first
#define Y second
#define pb push_back
#define cl(a,b) memset(a,b,sizeof(a));
int a[maxn];
int main(){
    int n,k;
    while(~scanf("%d%d",&n,&k)){
        int m=n/k;
        cl(a,0);
        for(int i=0;i<n;i++){
            int x;scanf("%d",&x);
            a[x]++;
        }
        int ans=0;
        for(int i=1;i<=k;i++){
            if(a[i]<m)ans+=m-a[i];
        }
        printf("%d\n",ans);

    }
    return 0;
}