Submission #76442128

---

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 endl "\n"
#define il inline
#define ls 2*k
#define rs 2*k+1
using namespace std;
const int N=2e5+5,M=2505;
const int mod=1e9+7;
inline int read(){
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
bool vis[N],in[N];
int n,k,m;
pair<int,int>a[N];
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int tc=1;
	while(tc--){
        cin>>n>>k>>m;
		for(int i=1;i<=n;i++){
			int x,y;
			cin>>x>>y;
			a[i]={y,x};
		}
		sort(a+1,a+n+1,greater< pair<int,int> >());
		int ans=0,cnt=0,ret=0;
		for(int i=1;i<=n;i++){
			if(!vis[a[i].second]){
				ans+=a[i].first;
				ret++,vis[a[i].second]=1,cnt++;
				in[i]=1;
			}
			if(cnt>=m || ret>=k) break; 
		}
		for(int i=1;i<=n;i++){
			if(ret>=k) break;
			if(in[i]) continue;
			ans+=a[i].first,ret++;
		}
		cout<<ans<<'\n';
	}
	return 0;
}
/*

*/

Submission Info

Judge Result