HDOJ1051

/*求最少序列数*/
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;


#define M 5010


struct aa
{
int x, y;
bool z ;
}a[M];


bool cmp(aa a, aa b)
{
if (a.x == b.x) return a.y < b.y;
else return a.x < b.x;
}


int main()
{
int t;
cin >> t;
for (int i = 0; i < t; i++)
{
int n, sum=0;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i].x >> a[i].y;
a[i].z = true;
}
sort(a, a + n, cmp);
for (int i = 0; i < n; i++)
{
if (!a[i].z) continue;
a[i].z = false;
sum++;
int nl = a[i].x, nw = a[i].y;  //主要
for (int j = i+1; j < n; j++)
{
if (nl <= a[j].x&&nw <= a[j].y&&a[j].z)//追踪上一个节点
{
a[j].z = false;
nl = a[j].x;  //覆盖
nw=a[j].y;
}
}
}
cout << sum << endl;
}
return 0;
}