Submission

Score: 100

User: SUN

Problemset: พอด

Language: cpp

Time: 0.012 second

Submitted On: 2025-10-06 10:18:14

#include <iostream>
#include <vector>
int main()
{
	int n = 0 , s , k , minpod = 2e8;
	std::cin >> n;
	std::cin >> k;
	std::vector<int> people(k+1);
	for(int i = 0;i<n;i++)
	{
		std::cin >> s;
		people[s]++;
	}
	for (int i = 0; i < k; i++)
	{
		if(people[i + 1] < minpod)
		{
			minpod = people[i + 1];
		}
	}
	std::cout << n - (k * minpod);
}