poj 3614 Sunscreen （优先队列）

Sunscreen

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8996		Accepted: 3158

Description

To avoid unsightly burns while tanning, each of the C (1 ≤ C ≤ 2500) cows must cover her hide with sunscreen when they're at the beach. Cow i has a minimum and maximum SPF rating (1 ≤ minSPFi ≤ 1,000; minSPFi ≤ maxSPFi ≤ 1,000) that will work. If the SPF rating is too low, the cow suffers sunburn; if the SPF rating is too high, the cow doesn't tan at all........

The cows have a picnic basket with L (1 ≤ L ≤ 2500) bottles of sunscreen lotion, each bottle i with an SPF rating SPFi (1 ≤ SPFi ≤ 1,000). Lotion bottle i can cover coveri cows with lotion. A cow may lotion from only one bottle.

What is the maximum number of cows that can protect themselves while tanning given the available lotions?

Input

* 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

Output

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

Sample Input

3 2
3 10
2 5
1 5
6 2
4 1

Sample Output

2

思路：先将奶牛可承受的最小阳光按照从小到大排列，把防晒霜也按照从小到大排，然后用优先队列，把最小值小于防晒霜的push

进队列，然后进行算出多少只可以晒太阳。

代码：

#include <iostream> #include <stdio.h> #include <string.h> #include <queue> #include <algorithm> #include <vector> using namespace std; int rudu[30005]; struct node { int a,b; }cow[2505]; bool cmp(node a,node b) { return a.a<b.a; } struct rr { int m,n; }fss[2505]; bool cmp1(rr a,rr b) { return a.m<b.m; } int main() { int C,L; while(cin>>C>>L) { int i,j; priority_queue<int,vector<int>,greater<int> >Q; for(i=0;i<C;i++) { scanf("%d %d",&cow[i].a,&cow[i].b); } sort(cow,cow+C,cmp); for(i=0;i<L;i++) { scanf("%d %d",&fss[i].m,&fss[i].n); } sort(fss,fss+L,cmp1); j=0; int sum=0; for(i=0;i<L;i++) { while(j<C&&cow[j].a<=fss[i].m) { Q.push(cow[j].b); j++; } while(!Q.empty()&&fss[i].n) { int k=Q.top(); Q.pop(); if(fss[i].m<=k) { sum++; fss[i].n--; } } } cout<<sum<<endl; } return 0; }