Result: Accepted
Time: 12ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct fen
{
char name[30];
int a;
int b;
int d;
};
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n,i,j;
struct fen c[100],m;
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%s %d %d",c[i].name,&c[i].a,&c[i].b);}
for(i=0;i<n;i++)
{c[i].d=c[i].a+c[i].b;}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(c[i].d<c[j].d)
{
m=c[i];
c[i]=c[j];
c[j]=m;
}
}
}
for(i=0;i<n;i++)
{printf("%s\n",c[i].name);}
}
return 0;
}