Stall Reservations 贪心+自定义优先级的优先队列（求含不重叠子序列的多个序列最小值问题）

#include<stdio.h>
#include<algorithm>
#include<queue>
using namespace std;

struct Node{
    int x,y,no;
    friend bool operator<(Node a,Node b)
    {
        if(a.y==b.y) return a.x>b.x;
        return a.y>b.y;
    }
}node[50005];
bool cmp(Node a,Node b)
{
    if(a.x==b.x) return a.y<b.y;
    return a.x<b.x;
}
int a[50005];
priority_queue<Node> q;
int main()
{
    int n,c,i;
    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%d%d",&node[i].x,&node[i].y);
        node[i].no=i;
    }
    sort(node+1,node+n+1,cmp);
    q.push(node[1]);
    a[node[1].no]=1;
    c=1;
    for(i=2;i<=n;i++){
        if(q.size()&&node[i].x>q.top().y){
            a[node[i].no]=a[q.top().no];
            q.pop(); 
        }
        else{
            c++;
            a[node[i].no]=c;
        }
        q.push(node[i]);
    }
    printf("%d\n",c);
    for(i=1;i<=n;i++){
        printf("%d\n",a[i]);
    }
    return 0;
}