hdu 4864 Task (贪心 技巧)

 1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdlib>
 4 #include <cmath>
 5 #include <cstdio>
 6 #include <vector>
 7 #include <algorithm>
 8 #define LL long long
 9 using namespace std;
10 const int maxn = 100000+10;
11 int n, m, f[110];
12 struct node
13 {
14     int x, y;
15 } ma[maxn], ta[maxn];
16 
17 bool cmp(node a, node b)
18 {
19     if(a.x==b.x)
20         return a.y > b.y;
21     return a.x > b.x;
22 }
23 int main()
24 {
25     int i, j, k, cnt;
26     __int64 ans;
27     while(~scanf("%d%d", &n, &m))
28     {
29         ans = 0;  cnt = 0;
30         memset(f, 0, sizeof(f));
31         for(i = 0; i < n; i++)
32             scanf("%d%d", &ma[i].x, &ma[i].y);
33         for(i = 0; i < m; i++)
34             scanf("%d%d", &ta[i].x, &ta[i].y);
35         sort(ma, ma+n, cmp);
36         sort(ta, ta+m, cmp);
37         j = 0;
38         for(i = 0; i < m; i++)
39         {
40             while(j < n)
41             {
42                 if(ma[j].x >= ta[i].x)
43                 f[ma[j].y] ++;
44                 else break;
45                 j ++;
46             }
47             for(k = ta[i].y; k <= 100; k++)
48             {
49                 if(f[k])
50                 {
51                     f[k] --;
52                     ans += 500*ta[i].x + 2*ta[i].y;
53                     cnt ++;
54                     break;
55                 }
56             }
57         }
58         printf("%d %I64d\n", cnt, ans);
59     }
60     return 0;
61 }