Submission

Score: 100

User: Sunsblad

Problemset: พอด

Language: cpp

Time: 0.022 second

Submitted On: 2025-12-07 11:05:25

#include <iostream>
#include <vector>
using namespace std;
int main()
{
	int n = 0, b = 0, min = 2e8, m = 0, sum = 0;
	cin >> n;
	cin >> m;
	vector<int> pod(m);
	for(int i = 0; i < n;i++)
	{
		cin >> b;
		pod[b-1]++;
	}
	for(int i = 0; i < m; i++)
	{
		if(pod[i] < min)
		{
			min = pod[i];
		}
	
	}
	for (int i = 0; i < m; i++)
	{
			pod[i] -= min;
	}
	for (int i = 0; i < m; i++)
	{
		sum += pod[i];
	}
	cout << sum;
}