* Line 1: Two space-separated integers: C and L * Lines 2..C+1: Line i describes cow i's lotion requires with two integers: minSPFi and maxSPFi  * Lines C+2..C+L+1: Line i+C+1 describes a sunscreen lotion bottle i with space-separated integers: SPFi and coveri

A single line with an integer that is the maximum number of cows that can be protected while tanning

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<queue>
 5 #include<algorithm>
 6 #include<vector>
 7 using namespace std;
 8 #define N 2600
 9 int n,m;
10 struct Node{
11     int l,r;
12     bool friend operator < (Node a,Node b){
13         return a.r>b.r;
14     }
15 }cow[N];
16 struct Node1{
17     int x,num;
18 }p[N];
19 bool cmp(Node a,Node b){
20     return a.l<b.l;
21 }
22 bool cmp1(Node1 a,Node1 b){
23     return a.x<b.x;
24 }
25 int main()
26 {
27     while(scanf("%d%d",&n,&m)==2){
28
29         for(int i=0;i<n;i++){
30             scanf("%d%d",&cow[i].l,&cow[i].r);
31         }
32         for(int i=0;i<m;i++){
33             scanf("%d%d",&p[i].x,&p[i].num);
34         }
35         sort(cow,cow+n,cmp);
36         sort(p,p+m,cmp1);
37
38         //for(int i=0;i<v.size();i++){
39         //    printf("---%d\n",v[i]);
40         //}
41
42         priority_queue<Node>q;
43
44         int k=0;
45         int ans=0;
46         for(int i=0;i<m;i++){
47             while(k<n && cow[k].l<=p[i].x){
48                     q.push(cow[k]);
49                     k++;
50             }
51
52             int w=0;
53             while(!q.empty()){
54
55                 if(w>=p[i].num) break;
56
57                 Node tmp=q.top();
58                 if(tmp.r>=p[i].x){
59                     q.pop();
60                     ans++;
61                     w++;
62                 }
63                 else{
64                     q.pop();
65                 }
66
67             }
68         }
69         printf("%d\n",ans);
70     }
71     return 0;
72 }