poj 3190 Stall Reservations

题目链接：http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=39459

典型的贪心：

#include<stdio.h>
#include<algorithm>
using namespace std;
const int N = 5e4 + 17;

struct point
{
int x,y,n,m;
};

point str
,arr
;
int p
;

bool cmx(point a,point b)
{
return a.x < b.x;
}

bool cmy(point a,point b)
{
return a.y < b.y;
}

bool cmd(point a,point b)
{
return a.n < b.n;
}

void test(int n)
{
for(int i=0; i<n; i++)
{
scanf("%d%d",&str[i].x, &str[i].y);
str[i].n = i;
arr[i] = str[i];
}
sort(str,str+n,cmx);
sort(arr,arr+n,cmy);

for(int i=0; i<n; i++)
p[str[i].n] = i;

int ans = 0, b = 0;
for(int i=0; i<n; i++)
{
if(str[i].x > arr[b].y)
{
int s = p[arr[b].n];
str[i].m = str[s].m, b ++;
}
else
str[i].m = ++ ans;
}
sort(str,str+n,cmd);
printf("%d\n",ans);
for(int i=0; i<n; i++)
printf("%d\n",str[i].m);
}

int main()
{
int t;
while(scanf("%d",&t)!=EOF)
test(t);
return 0;
}