Result: Accepted
Time: 11ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
struct ss{
char name[100];
int x;
int y;
int j;
}mm;
struct rr{
int j;
char name1[100];
}r;
int comp(const void*p,const void *q){
return ((struct ss*)q)->j-((struct ss *)p)->j;
}
int main(void){
int a,b,t,n,i,j,k;
struct ss mm[100];
struct rr r[100];
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s %d %d",mm[i].name,&mm[i].x,&mm[i].y);
mm[i].j=mm[i].x+mm[i].y;
}
qsort(mm,n,sizeof(struct ss),comp);
for(i=0;i<n;i++)
printf("%s\n",mm[i].name);
}
return 0;
}