舞会NKOJ P5223

传送：登录 | CQNK

#include<bits/stdc++.h>
using namespace std;
struct j{
	int x,y;
}a[1000003];
bool cmp(j i,j k){
	if(i.y==k.y){
		return i.x>k.x;
	}
	return i.y<k.y;
}
int main()
{
	int zh,n,i,an=1;
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%d%d",&a[i].x,&a[i].y);
	}
	sort(a+1,a+1+n,cmp);
	zh=a[1].y;
	for(i=2;i<=n;i++){
		if(a[i].x>=zh){
			an++;
			zh=a[i].y;
		}
	}
	printf("%d",an);
	return 0;
}