Submission #75236545

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define ll long long
#define ull unsigned long long
#define inf 1e18
#define eps 1e-9
#define ls 2*k
#define rs 2*k+1
using namespace std;

const int N=3e5+5,M=1e7;
const int mod=998244353;
const int dx[4]={0,0,1,-1},dy[4]={1,-1,0,0};

int n,k,a[N];
map<int,int>cnt;
priority_queue<int>q;

signed main(){

    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int tc=1; 
    while(tc--){
    	cin>>n>>k;
    	int sum=0;
    	for(int i=1;i<=n;i++) cin>>a[i],cnt[a[i]]++,sum+=a[i];
    	for(int i=1;i<=n;i++){
    		if(!cnt[a[i]]) continue;
    		q.push(cnt[a[i]]*a[i]);
    		cnt[a[i]]=0;
		}
		while(!q.empty() && k){
			int now=q.top();
			q.pop();
			sum-=now;
			--k;
		}
		cout<<sum<<'\n';
    }

    return 0;
}

Submission Info

Judge Result