POJ 3190 Stall Reservations

题意：有n头奶牛，每头奶牛都有它唯一的挤奶时间，并且同一台机器不能同时挤两头奶牛，问怎么安排挤奶，使用的机器最少

#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int N = 50010;
int pos[N];//记录i在哪个栏位
struct node
{
	int left;
	int right;
	int id;
	bool operator < (const node &b)const
	{
		if(right==b.right)
			return left>b.left;
		return right>b.right;
	}
}data[N];
bool cmp(node a,node b)
{
	if(a.left==b.left)
	return a.right<b.right;
	return a.left<b.left;
}
int main()
{
	int n,flag=0,k=1;
	priority_queue<node> q;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d%d",&data[i].left,&data[i].right);
		data[i].id=i;
	}
	sort(data,data+n,cmp);
	q.push(data[0]);
	pos[data[0].id]=k;
	for(int i=1;i<n;i++)
	{
		if(!q.empty()&&q.top().right<data[i].left)
		{
			pos[data[i].id] = pos[q.top().id];
			q.pop();
		}
		else
		{
			k++;
			pos[data[i].id] = k;
		}
		q.push(data[i]);
	}
	printf("%d\n",k);
	for(int i=0;i<n;i++)
	printf("%d\n",pos[i]);
}