nyoj 8

http://acm.nyist.net/JudgeOnline/problem.php?pid=8

 #include<stdio.h>
 #include<iostream>
 #include<string>
 #include<algorithm>
 using namespace std;
 struct node
 {
     int s;
     int l;
     int r;
 }t[];
 int max(int x,int y )
 {
     return x>y?x:y;
 }
 int min(int x,int y)
 {
     return x<y?x:y;
 }
 bool cmp(node x,node y)
 {
     if(x.s!=y.s)
     {
         return x.s<y.s;
     }
     else
     {
         if(x.l!=y.l)
             return x.l<y.l;
         else
             return x.r<y.r;
     }
 }
 int main()
 {
     int t1,i,a,b,c,n;
     scanf("%d",&t1);
     while(t1--)
     {
         scanf("%d",&n);
         for(i=;i<n;i++)
             scanf("%d %d %d",&t[i].s,&a,&b),
             t[i].l=max(a,b),
             t[i].r=min(a,b);
         sort(t,t+n,cmp);
         for(i=;i<n;i++)
         {
             while(t[i+].l==t[i].l&&t[i].l==t[i+].l&&t[i].r==t[i+].r&&i+<n)i++;
             printf("%d %d %d\n",t[i].s,t[i].l,t[i].r);
         }
     }
     //system("pause");
     return ;
 }