Submission #1986029

---

Source Code Expand

#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define PB push_back
using namespace std;
typedef pair<int, int> P1;
typedef pair<int, pair<int, int> > P2;
static const int INF = 1ll<<60;
static const int dx[] = { 1, -1, 0, 0, };
static const int dy[] = { 0, 0, 1, -1 };
static const int mod = 1000000007;

int N,K;
int a[200005];

int kind;
int flag[200005];
int v[200005];
int ans;

signed main(){
    cin>>N>>K;
    for(int i=0;i<N;++i)v[i]=INF;
    for(int i=0;i<N;++i){
        cin>>a[i];
        a[i]--;
        if(!flag[a[i]]){
            kind++;
            v[a[i]]=0;
        }
        flag[a[i]]=1;
        v[a[i]]++;
    }
    if(kind<=K){
        cout<<0<<endl;
        return 0;
    }
    sort(v,v+N);
    for(int i=0;;++i){
        if(kind==K)break;
        ans+=v[i];
        kind--;
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result