A. Kitchen Utensils
Water.
1 #include <bits/stdc++.h> 2 using namespace std; 3 4 #define N 110 5 int n, k, cnt[N]; 6 7 int main() 8 { 9 while (scanf("%d%d", &n, &k) != EOF) 10 { 11 memset(cnt, 0, sizeof cnt); 12 for (int i = 1, x; i <= n; ++i) 13 { 14 scanf("%d", &x); 15 ++cnt[x]; 16 } 17 int Max = 0; 18 for (int i = 1; i <= 100; ++i) Max = max(Max, cnt[i] % k == 0 ? cnt[i] / k : cnt[i] / k + 1); 19 int res = 0; 20 for (int i = 1; i <= 100; ++i) if (cnt[i]) 21 { 22 res += Max * k - cnt[i]; 23 } 24 printf("%d\n", res); 25 } 26 return 0; 27 }