CF 496E Distributing Parts

#include <cstdio>
#include <cstring>
#include <set>
#include <algorithm>
using namespace std;
#define N 100000
struct Node
{
    int lef,rig,val,laber;
} a[N+20],b[N+20];
int c[N+20],ans[N+20];
bool vist[N+20];
set<pair<int,int> > heap;
bool cmp1(const Node &x,const Node &y)
{
    return x.lef<y.lef||(x.lef==y.lef&&x.rig<y.rig);
}
int main()
{
    //freopen("input","r",stdin);
    int n;
    scanf("%d",&n);
    int cnt = 0;
    for (int i=0; i<n; i++)
    {
        scanf("%d%d",&a[i].lef,&a[i].rig);
        a[i].laber = i;
        c[cnt++] = a[i].lef;
    }
    int m;
    scanf("%d",&m);
    for (int i=0; i<m; i++)
    {
        scanf("%d%d%d",&b[i].lef,&b[i].rig,&b[i].val);
        b[i].laber = i;
    }
    sort(a,a+n,cmp1);
    sort(b,b+m,cmp1);
    sort(c,c+n);
    int len = unique(c,c+n) - c;
    int bl = 0, br = 0;
    int k = 0;
    for (int i=0; i<len&&k<n; i++)
    {
        while (b[bl].lef<=c[i]&&bl<m)
        {
            heap.insert(pair<int,int>(b[bl].rig,bl));
            bl++;
        }
        while (b[br].rig<c[i]&&br<m)
        {
            if (!vist[br]) heap.erase(pair<int,int>(b[br].rig,br));
            br++;
        }
        while (a[k].lef==c[i]&&k<n)
        {
            if (heap.empty())
            {
                printf("NO\n");
                return 0;
            }
            set<pair<int,int> >::iterator it = heap.lower_bound(pair<int,int>(a[k].rig,-1));
            if (it==heap.end())
            {
                printf("NO\n");
                return 0;
            }
            pair<int,int> j = *it;
            ans[a[k].laber] = b[j.second].laber;
            b[j.second].val--;
            //printf("%d %d\n",j.second,b[j.second].val);
            if (b[j.second].val==0)
            {
                heap.erase(it);
                vist[j.second] = true;
            }
            k++;
        }
    }
    printf("YES\n");
    for (int i=0; i<n; i++) printf("%d ",ans[i]+1);
    printf("\n");
    return 0;
}