Submission #76439315

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define int long long 

const int N=2e5+5;

bool st;
int n,m,k;
struct node{int c,v;}a[N];
bool cmp(node a,node b) {
	if(a.v==b.v) return a.c>b.c;
	return a.v>b.v;
}bool used[N];
bool ed;

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cerr<<(double)(&st-&ed)/1024/1024<<'\n';
	cin>>n>>k>>m;
	for(int i=1;i<=n;i++) {cin>>a[i].c>>a[i].v;}
	sort(a+1,a+n+1,cmp);
	int cnt=0,col=0,ans=0;
	for(int i=1;i<=n;i++) {
		if(!used[a[i].c]) {
			used[a[i].c]=1,cnt++,col++;ans+=a[i].v;
		}else if(m-col!=k-cnt){
			cnt++,ans+=a[i].v;
		}
		if(cnt==k) {break;}
	}cout<<ans<<'\n';
	return 0;
}

Submission Info

Judge Result