HDU4544+优先队列

 

View Code 
 1 /*
 2 排序+优先队列
 3 */
 4 #include<stdio.h>
 5 #include<string.h>
 6 #include<stdlib.h>
 7 #include<algorithm>
 8 #include<iostream>
 9 #include<queue>
10 #include<map>
11 #include<vector>
12 #include<math.h>
13 using namespace std;
14 typedef long long ll;
15 typedef __int64 int64;
16 const int maxn = 2000005;
17 const int inf = 0x7fffffff;
18 const double pi=acos(-1.0);
19 const double eps = 1e-8;
20 struct node{
21     int pi,di;
22 }a[ maxn ];
23 int cmp( node a,node b ){
24     if( a.di!=b.di ) return a.di>b.di;
25     else return a.pi<b.pi;
26 }
27 int main(){
28     int n,m;
29     while( scanf("%d%d",&n,&m)==2 ){
30         int cnt = 0;
31         for( int i=0;i<n;i++ ){
32             scanf("%d",&a[ i ].di);
33             a[ i ].pi = -1;
34         }
35         cnt = n;
36         for( int i=0;i<m;i++ ){
37             scanf("%d",&a[ cnt ].di);
38             cnt++;
39         }
40         cnt = n;
41         for( int i=0;i<m;i++ ){
42             scanf("%d",&a[ cnt ].pi);
43             cnt++;
44         }
45         sort( a,a+cnt,cmp );
46         __int64 ans = 0;
47         bool flag = true;
48         int kill = 0;
49         priority_queue< int,vector<int>,greater<int> > q;
50         for( int i=0;i<cnt&&kill<n;i++ ){
51             if( a[ i ].pi<0 ){
52                 if( q.empty() ){
53                     flag = false;
54                     break;
55                 }
56                 ans += q.top();
57                 //printf("ans:%d\n",q.top());
58                 q.pop();
59                 kill++;
60             }
61             else{
62                 q.push( a[ i ].pi );
63             }
64         }
65         if( flag == false ) printf("No\n");
66         else printf("%I64d\n",ans);
67     }
68     return 0;
69 }

 

posted @ 2013-04-01 21:22  xxx0624  阅读(316)  评论(0)  编辑  收藏  举报