Submission

Status:

PP-P-PPPPP

Subtask/Task Score:

80/100

Score: 80

User: boommmmm

Problemset: พอด

Language: cpp

Time: 0.012 second

Submitted On: 2025-10-17 11:18:55

#include<bits/stdc++.h>
using namespace std;

int main()
{
	int n,k,suym=0;
	cin >> n >> k;
	vector<int> v(n);
	vector<int> vec(k);
	for(int i=0;i<n;i++){
		cin >> v[i];
		vec[v[i]]++;
	}
	int mn=INT_MAX;
	for(int i=1;i<=k;i++){
		mn=min(mn,vec[i]);
	}
	for(int i=1;i<=k;i++){
		vec[i]-=mn;
		suym+=vec[i];
	}
	cout << suym;
	
	return 0;	
}