Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: dddrrrr
Problemset: พอด
Language: cpp
Time: 0.005 second
Submitted On: 2025-10-17 08:54:11
#include <bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0)->sync_with_stdio(0);
cout.tie(0)->sync_with_stdio(0);
int n ,k;
cin >> n >> k;
vector <int> vec(k+1); //1-indexed
for(int i=0 ;i<n ;i++){
int x ;cin >> x;
vec[x]++;
}
int mn = INT_MAX;
for(int i=1 ;i<=k ;i++)mn = min(mn ,vec[i]);
int ans = 0;
for(int i=1 ;i<=k ;i++){
if(vec[i] > mn)ans += (vec[i] - mn);
}
cout << ans;
return 0;
}