南阳236----心急的C小加

#include<cstdio>
#include<algorithm>
#define inf 1<<30
using namespace std;

typedef struct
{
    int l,w;
} cus;
cus a[5005],d[5005];
int top;

int cmp(cus x,cus y)
{
    if(x.l == y.l)
        return x.w < y.w;
    return x.l < y.l;
}

void solven(int x,int y)
{
    int i;
    for(i=0; i<=top; ++i)
        if(d[i].l <= x && d[i].w <= y)
        {
            d[i].l = x;
            d[i].w = y;
            break;
        }
    if(i == top + 1)
    {
        d[++top].l = x;
        d[top].w = y;
    }
}

int main()
{
    int t,n,i;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=0; i<n; ++i)
        {
            scanf("%d%d",&a[i].l,&a[i].w);
        }
        sort(a,a+n,cmp);
        d[0].l = d[0].w = inf;
        for(i=top=0; i<n; ++i)
            solven(a[i].l,a[i].w);
        printf("%d
",top);
    }
    return 0;
}