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