Result: Accepted
Time: 12ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
struct jojo
{
char name[32];
int num1;
int num2;
int sum;
};
int comp(const void *p,const void *q)
{
return((struct jojo *)q)->sum-((struct jojo *)p)->sum;
}
int main(void)
{
int T;
scanf("%d",&T);
while(T--)
{
int N;
struct jojo dio[100];
scanf("%d",&N);
int i;
for(i=0;i<N;i++)
{
scanf("%s",dio[i].name);
scanf("%d %d",&dio[i].num1,&dio[i].num2);
dio[i].sum=dio[i].num1+dio[i].num2;
}
qsort(dio,N,sizeof(struct jojo),comp);
for(i=0;i<N;i++)
printf("%s\n",dio[i].name);
}
}