hdu 5162(水题)

#include<stdio.h>
#include<iostream>
#include<string.h>
#include <stdlib.h>
#include<math.h>
#include<algorithm>
#include <queue>
using namespace std;
struct Kid{
    int id,v;
}kid[10];
int a[10];
int cmp(Kid a,Kid b){
    return a.v>b.v;
}
int main()
{
    int tcase;
    scanf("%d",&tcase);
    int t =1;
    while(tcase--){
        int n;
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            kid[i].v = max(a,max(b,c));
            kid[i].id = i;
        }
        sort(kid+1,kid+1+n,cmp);
        for(int i=1;i<=n;i++){
            a[kid[i].id]=i;
        }
        for(int i=1;i<n;i++){
            printf("%d ",a[i]);
        }
        printf("%d\n",a[n]);
    }
    return 0;
}