题目地址:http://ac.jobdu.com/problem.php?cid=1040&pid=21
C语言源码:
#include<stdio.h>
#include<stdlib.h>
typedef struct show
{
int start,end;
}show;
int cmp(const void *a,const void *b)
{
show *aa=(show *)a;
show *bb=(show *)b;
return aa->end-bb->end;
}
int main()
{
int n,a,num,i;
show s[101];
scanf("%d",&n);
while(n)
{
for(i=0;i<n;i++)
scanf("%d %d",&s[i].start,&s[i].end);
qsort(s,n,sizeof(s[0]),cmp);
a=0;
num=0;
for(i=0;i<n;i++)
{
if(s[i].start>=a)
{
num++;
a=s[i].end;
}
}
printf("%d\n",num);
scanf("%d",&n);
}
}