Submission #75262271

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
map<int,int>cnt;
int n,k,x,m,sum,val[300001];
signed main() {
    cin>>n>>k;
    for(int i=0;i<n;i++){
        cin>>x;
        cnt[x]++;
        sum+=x;
    }
    for(map<int,int>::iterator it=cnt.begin();it!=cnt.end();it++){
        val[m++]=it->first*it->second;
    }
    sort(val,val+m,[](int a,int b){
		return a>b;
	});
    int res=0;
    for(int i=0;i<min(k,m);i++){
        res+=val[i];
    }
    cout<<sum-res;
}

Submission Info

Judge Result