BZOJ 1572[Usaco2009 Open]工作安排Job

#include<queue>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N=100010;
struct node{int x,y;}a
;
int Cmp(node x1,node x2){if(x1.x!=x2.x)return x1.x<x2.x;return x1.y>x2.y;}
priority_queue<int>q;
int main()
{
int n,i,use=0;
scanf("%d",&n);
for(i=1;i<=n;i++)scanf("%d%d",&a[i].x,&a[i].y);
sort(a+1,a+1+n,Cmp);
LL ans=0;
for(i=1;i<=n;i++)
{
ans+=(LL)a[i].y,use++,q.push(-a[i].y);
if(use>a[i].x){ans+=(LL)q.top(),q.pop(),use--;}
}
printf("%lld\n",ans);
return 0;
}