地鼠游戏 Codevs No.1245

 1 //地鼠游戏 (Codevs No.1052)
 2 //贪心
 3 #include<stdio.h>
 4 #include<algorithm>
 5 #include<queue>
 6 using namespace std;
 7 const int maxn=110;
 8 struct node
 9 {
10     int key;
11     int time;
12 };
13 node F[maxn];
14 bool comp(node a,node b)
15 {
16     return a.time>b.time;
17 }
18 priority_queue <int> q;
19 int ans;
20 int N;
21 int main()
22 {
23     scanf("%d",&N);
24     for(int i=1;i<=N;i++)scanf("%d",&F[i].time);
25     for(int i=1;i<=N;i++)scanf("%d",&F[i].key);
26     sort(F+1,F+N+1,comp);
27     int now=F[1].time;
28     int loc=1;
29     while(now)
30     {
31         while(F[loc].time==now)
32         {
33             q.push(F[loc].key);
34             loc++;
35         }
36         if(!q.empty())
37         {
38             ans+=q.top();
39             q.pop();
40         }
41         now--;
42     }
43     printf("%d",ans);
44     return 0;
45 }