#include<iostream>
#include<algorithm>
using namespace std;
int c,l,cnt;
struct nd{
int min,max;
}mspf[2505];
struct node{
int sp,cover;
}spf[2505];
bool cmp(nd a,nd b){
return a.min > b.min;
}
bool cmpp(node a,node b){
return a.sp > b.sp;
}
int main(){
cin >> c >> l;
for(int i = 1;i <= c;i++){
cin >> mspf[i].min >> mspf[i].max;
}
for(int i = 1;i <= l;i++){
cin >> spf[i].sp >> spf[i].cover;
}
sort(mspf+1,mspf+1+c,cmp);
sort(spf+1,spf+1+l,cmpp);
for(int i = 1;i <= c;i++){
for(int j = 1;j <= l;j++){
if(mspf[i].min <= spf[j].sp && mspf[i].max >= spf[j].sp && spf[j].cover > 0){
spf[j].cover--;
cnt++;
break;
}
}
}
cout << cnt;
return 0;
}
奶牛日光浴
最新推荐文章于 2024-10-07 19:01:55 发布