一种排序

/*日期：2011-10-14
  作者：xiaosi
  题目：一种排序
*/
#include<iostream>
#include<cstdio>
#include<stdlib.h>
using namespace std;
struct Rectangle
{
    int num;
    int a;
    int b;
    int l;
    int w;
}R[1000];
int cmp( const void *a , const void *b )
{
    struct Rectangle *c = (Rectangle *)a;
    struct Rectangle *d = (Rectangle *)b;
    if(c->a > c->b)
    {
        c->l=c->a;
        c->w=c->b;
    }
    else
    {
        c->l=c->b;
        c->w=c->a;
    }
    if(d->a >d->b)
    {
        d->l=d->a;
        d->w=d->b;
    }
    else
    {
        d->l=d->b;
        d->w=d->a;
    }
    if(c->num!=d->num)
    {
        return c->num - d->num;
    }
    else if(c->l!=d->l)
    {
        return c->l - d->l;
    }
    else
    {
        return c->w - d->w;
    }
}
int main()
{
    int N;
    while(scanf("%d",&N)!=EOF)
    {
        while(N--)
        {
            int n,i;
            scanf("%d",&n);
            for(i=0;i<n;i++)
            {
                scanf("%d %d %d",&R[i].num,&R[i].a,&R[i].b);
            }
            qsort(R,n,sizeof(R[0]),cmp);
            for(i=0;i<n;i++)
            {
                while((R[i].num==R[i+1].num)&&(R[i].l==R[i+1].l)&&(R[i].w==R[i+1].w))
                {
                    i++;
                }
                printf("%d %d %d\n",R[i].num,R[i].l,R[i].w);
            }
        }
    }
    return 0;
}