题意:给牛涂防晒霜,每个牛有一个上限(max)和下限(min)的防晒值,每瓶防晒霜有固定的防晒值,每瓶防晒霜只能给一头牛用。已知牛的个数,上下限,防晒霜的每个种类的防晒值和对应的瓶数。
题解:对牛和防晒霜进行升序排序,然后取靠牛的下限最近的防晒霜即可。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <cassert>
#include <deque>
#include <map>
#include <queue>
#define INF 0x3f3f3f3f
using namespace std;
struct cow{
int l;
int r;
}a[2510];
struct sunscreen{
int s;
int num;
}b[2510];
priority_queue<int,vector<int>,greater<int> >q;
bool cmp(cow a,cow b){
return a.l<b.l;
}
bool cmp1(sunscreen a,sunscreen b){
return a.s<b.s;
}
int main() {
int c,l;
cin>>c>>l;
for(int i = 0 ; i < c ; i++){
scanf("%d %d",&a[i].l,&a[i].r);
}
for(int i = 0 ; i < l ; i++){
scanf("%d %d",&b[i].s,&b[i].num);
}
sort(a,a+c,cmp);
sort(b,b+l,cmp1);
int k = 0;
int ans = 0;
for(int i = 0 ; i < l ; i++){
while(k<c&&a[k].l<=b[i].s){
q.push(a[k].r);
k++;
}
while(b[i].num&&!q.empty()){
int j = q.top();
q.pop();
if(b[i].s<=j){
ans++;
b[i].num--;
}
}
}
cout<<ans<<endl;
}