51nod 1163 最高的奖励(贪心+优先队列)

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 #include<queue>
 5 using namespace std;
 6 typedef long long ll;
 7 const int N = 50001;
 8 struct task{
 9     int e;
10     int w;
11 }a[N];
12 bool cmp(task x, task y){
13     return x.e < y.e;
14 }
15 priority_queue<int, vector<int>, greater<int> >q;
16 int main(){
17     int n, i, j;
18     ll ans = 0;
19     scanf("%d", &n);
20     for(i = 0; i < n; ++i)
21         scanf("%d%d", &a[i].e, &a[i].w);
22     sort(a, a+n, cmp);
23     for(i = 0; i < n; ++i){
24         if(a[i].e > q.size()){
25         //如果该任务最晚结束时间比当前时间点晚
26             q.push(a[i].w);
27             ans += a[i].w;
28         }
29         else{
30             //可能替换为奖励更高的任务
31             ans += a[i].w;
32             q.push(a[i].w);
33             ans -= q.top();
34             q.pop();
35         }
36     }
37     printf("%lld\n", ans);
38     return 0;
39 }