矩形嵌套

/*
不是贪心，若是先按长排序在按宽，若是长很大宽很小 ,则若是后边款稍微大一些就不行了 
*/
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 1005;
typedef struct Node
{
    int a;
    int b;
}Node;
Node q[N];
int n;
int d[N];

bool cmp(const Node &a, const Node &b)
{
    if (a.a == b.a)
        return a.b < b.b;
    return a.a < b.a;
} 

bool judge(int i, int j)
{
    bool flag = q[i].a>q[j].a && q[i].b>q[j].b;
    if (flag)
    {
        return true;
    }
    return false;
}

int main()
{
    int T;
    int a, b;
    int i,j,k;
    cin>>T;
    while (T--)
    {
        cin>>n;
        for (i=1; i<=n; i++)
        {
            cin>>a>>b;
            if (a>b)
            {
                swap(a, b);
                
            }
            q[i].a = a;
            q[i].b = b;
        }
        
        sort(q+1, q+n+1, cmp);
        int ans = 1;
        for (i=1; i<N; i++)
        {
            d[i] = 1;
        }
        
        for (i=2; i<=n; i++)//递推 
        {
            for (j=i-1; j>0; j--)
            {
                if (judge(i, j))
                {
                    int temp = d[j] + 1;//数组d必须要初始化 
                    if(d[i]>temp)
                       d[i] = temp;
                }
            }
            if(ans>d[i])
                 ans = d[i];
             
        }            
        cout<<ans<<endl;    
    }        
    system("pause");
    return 0;
}