学步园

活动安排，每一本算法书里都有吧！

如此之水。。。。。

#include"stdio.h"
#include"stdlib.h"
#define maxint 10002
typedef struct A
{
	int inr,outr;
}ring;
ring R[maxint];
int n;
int cmp (const void *a,const void *b)
{
	if(((ring *)a)->outr>((ring*)b)->outr)
		return 1;
	else
		return -1;
}
int main()
{
	FILE*fp=fopen("D:input1.txt","r");
	int right,i,count;
	while(fscanf(fp,"%d",&n)&&n)
	{
		for(i=0;i<n;i++)
			fscanf(fp,"%d%d",&R[i].inr,&R[i].outr);
		qsort(R,n,sizeof(ring),cmp);
		count=1;
		right=R[0].outr;
		for(i=1;i<n;i++)
		{
			if(right<=R[i].inr)
			{
				count++;
				right=R[i].outr;
			}
		}
		printf("%d\n",n-count);
	}
	return 0;
}