POJ3614

//弃去废/已读数据：eg valid，全局的循环指示变量 i 
//"<="和"<"
//priority_queue<int, vector<int>, greater<int> > 
//include functional库中 greater模板类使优先队列从小到大排列
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<functional>
using namespace std;
struct cow {
int max, min;
};
struct lotion {
int spf, cover;
};
cow c[2500 + 10];
lotion lot[2500 + 10];
bool cmplot(lotion a, lotion b) {
return a.spf<b.spf;
}
bool cmpmin(cow a, cow b) {
return a.min < b.min;
}


priority_queue<int, vector<int>, greater<int> > cs;
int main() {
int j=0,cnum, lnum, imin, imax, res = 0;
cin >> cnum >> lnum;
for (int i = 0; i<cnum; i++) {
cin >> imin >> imax;
c[i].min = imin, c[i].max = imax;


}
for (int i = 0; i<lnum; i++) {
cin >> imin >> imax;
lot[i].spf = imin, lot[i].cover = imax;
}
sort(lot, lot + lnum, cmplot);
sort(c, c + cnum, cmpmin);
for (int i = 0; i<lnum; i++) {
while (c[j].min <= lot[i].spf&&j < cnum) {
cs.push(c[j].max);
j++;
}
while (lot[i].cover>0 && !cs.empty()) {
int x = cs.top();
if (x >= lot[i].spf) {
res++;
lot[i].cover--;
}
cs.pop();
}
}
if (res > cnum) res = cnum;
cout << res << endl;
return 0;
}