BZOJ1572 [Usaco2009 Open]工作安排Job

经典贪心……倒着做，这样结束时间变开始时间，每个时间取最大的即可

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<queue>
#include<stack>
using namespace std;
#define MAXN 100010
#define MAXM 1010
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
#define ll long long
int n;
struct job{
int t;
int v;
friend bool operator <(job x,job y){
return x.t>y.t;
}
};
priority_queue<int>q;
job a[MAXN];
ll ans;
int main(){
int i;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d%d",&a[i].t,&a[i].v);
}
sort(a+1,a+n+1);
int wzh=1;
for(i=1;i<=n;i++){
while(a[wzh].t==a[i].t){
q.push(a[wzh].v);
wzh++;
}
i=wzh-1;
int rem=a[i].t-a[i+1].t;
while(rem&&q.size()){
ans+=q.top();
q.pop();
rem--;
}
}
printf("%lld\n",ans);
return 0;
}

/*

*/