POJ 3190 priority_queue 贪心

//By SiriusRen
#include <queue>
#include <cstdio>
#include <algorithm>
using namespace std;
int n,t=1,s[55555];
struct Node {int pos,begin,end;}node[55555];
struct Sirius{int time,num;}jy;
priority_queue<Sirius>pq;
bool operator<(Sirius a,Sirius b){return a.time>b.time;}
bool cmp(Node a,Node b){return a.begin<b.begin;}
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d%d",&node[i].begin,&node[i].end);
node[i].pos=i;
}
sort(node+1,node+1+n,cmp);
jy.num=1;jy.time=node[1].end;
pq.push(jy);
s[node[1].pos]=1;
for(int i=2;i<=n;i++){
if(node[i].begin>pq.top().time){
jy=pq.top();
pq.pop();
s[node[i].pos]=jy.num;
jy.time=node[i].end;
pq.push(jy);
}
else{
t++;
jy.time=node[i].end;
jy.num=t;
s[node[i].pos]=t;
pq.push(jy);
}
}
printf("%d\n",t);
for(int i=1;i<=n;i++)printf("%d\n",s[i]);
}