水题
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <set>
using namespace std;
#define ll long long
#define maxn 105
int color[maxn];
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int k, n;
scanf("%d%d", &n, &k);
int t;
for (int i = 0; i < n; ++i)
{
scanf("%d", &t);
color[t]++;
}
t = n / k;
int ans = 0;
for (int i = 1; i <= k; ++i)
{
if (color[i] > t)
ans += color[i] - t;
}
printf("%d\n", ans);
//system("pause");
//while (1);
return 0;
}