Result: Accepted
Time: 15ms
Memory: 1724kB
/*take it easy*/
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct ed
{
char name[50];
int ly,sj;
int sum;
}mmp[10001];
int comp(ed a,ed b)
{
return a.sum>b.sum;
}
int main(void)
{
int T;
scanf("%d",&T);
while(T--)
{ int N;
scanf("%d",&N);
int i;
for(i=0;i<N;++i)
{
scanf("%s %d %d",&mmp[i].name,&mmp[i].ly,&mmp[i].sj);
mmp[i].sum=mmp[i].ly+mmp[i].sj;
}
sort(mmp,mmp+N,comp);
for(i=0;i<N;++i)
{
printf("%s\n",mmp[i].name);
}
}
return 0;
}