A - Sunscreen

https://vjudge.net/contest/279730#problem/A

#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
int i,n,m,x,y,j,ans;
typedef  pair<int,int> p;
p a[100000],b[100000];
priority_queue<int,vector<int>,greater<int> >q;
int main()
{
    scanf("%d%d",&n,&m);
    for (i=1; i<=n; i++)
    {
        scanf("%d%d",&x,&y);
        a[i]=make_pair(x,y);
    }
    sort(a+1,a+n+1);
    for (i=1; i<=m; i++)
    {
        scanf("%d%d",&x,&y);
        b[i]=make_pair(x,y);
    }
    sort(b+1,b+1+m);
    j=1;
    for (i=1; i<=m; i++)
    {
        while (j<=n&&a[j].first<=b[i].first)
        {
            q.push(a[j].second);
            j++;
        }
        while (q.size()&&b[i].second>0)
        {
            int x=q.top();
            q.pop();
            if(x>=b[i].first)
            {
                b[i].second--;
                ans++;
            }
        }
    }
    printf("%d\n",ans);
}