20pts球跳

#include<bits/stdc++.h>
using namespace std;
const int N=5e4+5;
#define int long long
#define pii pair<int,int>
#define mk make_pair
#define fi first
#define se second
int n,ans,o[N],tot;
struct node{
	int s,e,id;
}a[N];
bool cmp(node x,node y){
	return x.s<y.s;
}
priority_queue<pii,vector<pii>,greater<pii> > q;
priority_queue<int,vector<int>,greater<int> > pq;
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i].s>>a[i].e,a[i].id=i;
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++){
		while(q.size()&&q.top().fi<a[i].s){
			pq.push(q.top().se);
			q.pop();
		}
		if(pq.size()){
			q.push(mk(a[i].e,pq.top()));
            o[a[i].id]=pq.top();
			pq.pop();
		}else{
			q.push(mk(a[i].e,++tot));
            o[a[i].id]=tot;
		}
	}
	cout<<q.size()<<'\n';
    for(int i=1;i<=n;i++) cout<<o[i]<<'\n';
	return 0;
}