题目链接:http://acm.nyist.net/JudgeOnline/problem.php?pid=14
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct point {
int s,e;
}a[10005];
bool cmp(point x,point y){
return x.e<y.e;
}
int main(){
int m;
scanf("%d",&m);
while(m--){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d%d",&a[i].s,&a[i].e);
sort(a,a+n,cmp);
int sum=1,k=a[0].e;
for(int i=1;i<n;i++){
if(a[i].s>k){
sum++;
k=a[i].e;
}
}
printf("%d\n",sum);
}
}