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