poj3614

来源：互联网发布：sql酒店管理系统编辑：程序博客网时间：2024/06/04 19:35
#include <cstdio>#include <cstring>#include <algorithm>#include <queue>using namespace std;#define MAX_N 2510int C,L;pair<int, int> arr[MAX_N];pair<int, int> brr[MAX_N];priority_queue<int, vector<int>, greater<int> > q; int main(){        scanf("%d%d", &C, &L);        for(int i = 0;i < C; i++)                scanf("%d%d", &arr[i].first, &arr[i].second);        for(int i = 0; i< L; i++)                scanf("%d%d", &brr[i].first, &brr[i].second);        sort(arr, arr + C);        sort(brr, brr + L);        int j = 0,ans = 0;        for(int i = 0; i < L; i++){                while(j < C && arr[j].first <= brr[i].first){                        q.push(arr[j].second);                        j++;                }                        while(!q.empty() && brr[i].second){                        int x = q.top(); q.pop();                        if(x < brr[i].first) continue;                        ans++;                        brr[i].second--;                }         }        printf("%d\n", ans);                return 0;}
0 0