Submission #3239521

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

typedef long long ll;

int x[200100];
int main() {
    int N, K;
    cin >> N >> K;
    fill(x, x+N, 0);

    for(int i = 0; i < N; i++){
        int a;  cin >> a;
        x[--a] += 1;
    }

    sort(x, x+N);
    int s = 0;
    for(int i = N - K - 1; i >= 0; i--){
        s += x[i];
    }
    cout << s << endl;

}

Submission Info

Judge Result