Codeforces 1079A Kitchen Utensils

http://codeforces.com/contest/1079/problem/A

还是水

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#define ll long long
#define mod 998244353
#define inf 0x3f3f3f3f
using namespace std;
#define ll long long
using namespace std;

int main()
{
    int n, k;
    map<int, int> m;
    int tmp;
    cin>>n>>k;
    int a[105];
    int cnt = 0;
    int maxy = -1;
    for(int i = 1; i <= n; i ++)
    {
        cin>>tmp;
        if(m[tmp] == 0){
            a[++ cnt] = tmp;
        }
        m[tmp] ++;
        maxy = max(maxy, m[tmp]);
    }
    int ans = 0;
    int num = (maxy / k + (maxy % k != 0)) * k;
    for(int i = 1; i <= cnt; i ++)
    {
        ans += num - m[a[i]];
    }
    cout<<ans<<endl;
    return 0;
}