显示代码纯文本
#include<bits/stdc++.h>
using namespace std;
int fa[10005];
int find(int x){
if(fa[x]==-1)return x;
else return fa[x]=find(fa[x]);}
struct q{int m,t;}a[10005];
int cmp(q w,q e){
if(w.m>e.m)return 1;
if(w.m==e.m&&w.t<e.t)return 1;
return 0;}
int tt;
int qain(){
freopen("supermarket.in","r",stdin);
freopen("supermarket.out","w",stdout);
int n;
while(scanf("%d",&n)==1){
memset(fa,-1,sizeof(fa));tt=0;
for(int i=1;i<=n;i++)
cin>>a[i].m>>a[i].t;
sort(a+1,a+1+n,cmp);
for(int i=1;i<=n;i++){
int fx=find(a[i].t);
if(fx>0){
fa[fx]=fx-1;
tt+=a[i].m; }}
cout<<tt; }
return 0;
}
int cr=qain();
int main()
{;}