三、搜索和二分 [Cloned] A - 贪心

原题：

Oh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A..B (1 <= A <= B <= 1,000,000), which includes both times A and B. Obviously, FJ must create a reservation system to determine which stall each cow can be assigned for her milking time. Of course, no cow will share such a private moment with other cows. 

Help FJ by determining:

• The minimum number of stalls required in the barn so that each cow can have her private milking period
• An assignment of cows to these stalls over time

Many answers are correct for each test dataset; a program will grade your answer

题意：

对一些奶牛挤奶，每头奶牛挤奶开始的时间和结束的时间都不同，而且显然奶牛不能在一起挤奶，问至少需要多个挤奶房以及挤奶的顺序。

题解:

贪心策略，对奶牛开始挤奶的时间从前到后排序，这样保证了挤奶的顺序化，然后优先队列是按照结束时间从前到后，这样入队的时候就可以比较入队奶牛的开始挤奶时间和即将最早结束的奶牛的时间，如果前者更晚就不必再加一个槽，反之就需要加一个，在结构体中再加一个槽序号，因为最后输出需要顺序。

代码：AC

#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
struct Node
{
	int start;
	int finish;
	int pos;
	friend bool operator<(Node a,Node b)
	{
		if(a.finish==b.finish)
			return a.start<b.start;
		return a.finish>b.finish;
	}
};
Node cow[50010];
int order[50010];
bool compare(Node a,Node b)
{
	if(a.start==b.start)
		return a.finish<b.finish;
	return a.start<b.start;
}
priority_queue<Node>Q;
int main()
{
	int n;
	cin>>n;
	int i;
	for(i=0;i<n;i++)
	{
		scanf("%d %d",&cow[i].start,&cow[i].finish);
		cow[i].pos=i+1;
	}
	sort(cow,cow+n,compare);
	Q.push(cow[0]);
	order[cow[0].pos]=1;
	int ans=1;
	for(i=1;i<n;i++)
	{
		if(!Q.empty()&&Q.top().finish<cow[i].start)
		{
			order[cow[i].pos]=order[Q.top().pos];
			Q.pop();
		}
		else
		{
			ans++;
			order[cow[i].pos]=ans;
		}
		Q.push(cow[i]);
	}
	printf("%d\n",ans);
	for(i=1;i<n+1;i++)
		printf("%d\n",order[i]);
	while(!Q.empty())
		Q.pop();
	return 0;
}