节目排序

# include<stdio.h>
# include<algorithm>
using namespace std;
struct s{
	int t1;
	int t2;
}a[105];
 int cmp(s u,s v){
 	if(u.t2==v.t2){
 	return 	u.t1>v.t1;
	 }
	return  u.t2<v.t2;	 
 }
 int main(){
 	int n,i,k,t;
 	while(scanf("%d",&n)!=EOF){
	 if(n==0){
	 	break;
	 }
 	for(i=0;i<n;i++){
 		scanf("%d%d",&a[i].t1,&a[i].t2);
	 }
	 sort(a,a+n,cmp);
	 k=1;
	 t=a[0].t2;
	 for(i=1;i<n;i++){
	 	if(a[i].t1>=t){
	 		t=a[i].t2;
	 		k++;
		 }
	 }
	 printf("%d\n",k);
}
return 0;
 }