#include <iostream>
#include <cstdlib>
using namespace std;
int cmp(const void *a, const void *b);
struct data
{
int b;
int e;
//int flag;
};
int main()
{
int T;
cin >> T;
data a[10010];
while(T--)
{
int n;
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> a[i].b >> a[i].e;
//a[i].flag = 1;
}
qsort(a+1, n, sizeof(a[0]), cmp);
int sum = 1;
int e = 0;
e = a[1].e;
for(int i = 2; i <= n; i++)
{
if(a[i].b >= e+1)
{
sum++;
e = a[i].e;
}
}
cout << sum << endl;
}
}
int cmp(const void *a, const void *b)
{
return ((data *)a)->e - ((data *)b)->e;
}
南阳理工OJ_题目14 会场安排问题
最新推荐文章于 2018-07-29 20:17:01 发布