NYIST 1107 最高的奖励

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cmath>
 5 #include <algorithm>
 6 #include <climits>
 7 #include <vector>
 8 #include <queue>
 9 #include <cstdlib>
10 #include <string>
11 #include <set>
12 #include <stack>
13 #define LL long long
14 #define INF 0x3f3f3f3f
15 #define pii pair<int,int>
16 using namespace std;
17 const int maxn = 100000;
18 pii d[maxn];
19 int main(){
20     int n,u,v;
21     priority_queue< pii,vector< pii >,greater< pii > > q;
22     while(~scanf("%d",&n)){
23         LL ans = 0;
24         while(!q.empty()) q.pop();
25         for(int i = 0; i < n; ++i)
26             scanf("%d %d",&d[i].first,&d[i].second);
27         sort(d,d+n);
28         for(int i = 0; i < n; ++i){
29             if(q.size() < d[i].first){
30                 ans += d[i].second;
31                 q.push(make_pair(d[i].second,d[i].first));
32             }else if(q.size() == d[i].first){
33                 if(d[i].second > q.top().first){
34                     ans += d[i].second - q.top().first;
35                     q.pop();
36                     q.push(make_pair(d[i].second,d[i].first));
37                 }
38             }
39         }
40         printf("%lld\n",ans);
41     }
42     return 0;
43 }