nyoj-236-心急的C小加

#include<stdio.h>
#include<stdlib.h>
struct mubang
{
int x;
int y;
}a[5005];
int cmp(const void *a,const void *b)
{
struct mubang *c=(struct mubang *)a;
struct mubang *d=(struct mubang *)b;
if(c->x!=d->x)
return c->x-d->x;
else
return c->y-d->y;
}
int main()
{
int s;
scanf("%d",&s);
while(s--)
{
int n,i,j,k=0,b[5005]={0};
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d%d",&a[i].x,&a[i].y);
qsort(a,n,sizeof(a[0]),cmp);
for(i=0;i<n;i++)
for(j=0;j<i;j++)
if(!b[j]&&a[i].x>=a[j].x&&a[i].y>=a[j].y)
{
a[j].x=a[i].x;
                    a[j].y=a[i].y;
b[i]=1;
break;
}
for(i=0;i<n;i++)
if(!b[i])
k++;
printf("%d\n",k);
}
return 0;
}