nyoj-707-A Simple Problem

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
struct AC
{
    char id[25];
    int num;
    int time;
}ac[110];
bool cmp(AC a,AC b)
{
    return a.num!=b.num?a.num>b.num:a.time!=b.time?a.time<b.time:strcmp(a.id,b.id)<0;
}
int main()
{
    int t,n,i;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(i=0;i<n;i++)
            scanf("%s%d%d",ac[i].id,&ac[i].num,&ac[i].time);
        sort(ac,ac+n,cmp);
        printf("%s
",ac[0].id);
    }
    return 0;
}