poj1828 Monkeys' Pride

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cstdio>
using namespace std;
struct node{
	int x;
	int y;
}a[50005];
int cmp(node a,node b){
	if(a.x==b.x) return a.y<b.y;
	else return a.x<b.x;
}
int main(){
	int n;
	int i;
	while(scanf("%d",&n)&&n!=0){
		for(i=0;i<n;i++)
			scanf("%d%d",&a[i].x,&a[i].y);
		sort(a,a+n,cmp);
		int cur=a[n-1].y;
		int sum=1;
		for(i=n-2;i>=0;i--)
			if(a[i].y>cur){
				cur=a[i].y;
				sum++;
			}
		printf("%d\n",sum);
	}
	return 0;
}