Submission #3692414

---

Source Code Expand

#include <iostream>
#include <algorithm>

#define N_MAX 200000

using namespace std;

int main(){
    int N, K;
    int A[N_MAX];
    int count[N_MAX] = {0};
    int nunique = 1;
    int ans = 0;
    cin >> N >> K;
    for(int i = 0; i < N; i++){
        cin >> A[i];
    }
    sort(A, A+N);
    
    count[0] = 1;

    for(int i = 1; i < N; i++){
        if(A[i] == A[i-1]){
            count[nunique-1]++;
        }else{
            nunique++;
            count[nunique-1]++;
        }
    }
    
    if(nunique <= K){
        cout << 0 << endl;
    }else{
        sort(count, count+nunique);
        for(int i = 0; i < nunique - K; i++){
            ans += count[i];
        }
        cout << ans << endl;
    }
}

Submission Info

Judge Result