codeforces 589I(水题)

题目链接： http://codeforces.com/problemset/problem/589/I #include<cstdio> #include<cstring> #include<algorithm> #include<iostream> #include<map> #include<vector> #include<cmath> #include<set> using namespace std; typedef long long ll; const int maxn = 30000 + 5; const double eps = 0.00000000000001; int vis[110]; int main() { int n,k; while(~scanf("%d%d",&n,&k)) { memset(vis, 0, sizeof(vis)); int num = n / k; int t; int sum = 0; for(int i = 0; i < n; i++) { scanf("%d",&t); vis[t]++; if(vis[t] > num) sum++; } printf("%d\n",sum); } return 0; }