Result: Accepted
Time: 17ms
Memory: 1628kB
#include<stdio.h>
#include<stdlib.h>
typedef struct node{
char name[100];
int m;
int n;
}stu;
int main()
{
int t,n,m;
stu temp;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
stu *stude=(stu*)malloc(n*sizeof(stu));
for(int i=0;i<n;i++)
{
scanf("%s %d %d",stude[i].name,&stude[i].m,&stude[i].n);
}
for(int i=1;i<n;i++)
for(int j=0;j<n-i;j++)
if((stude[j].m+stude[j].n)<(stude[j+1].m+stude[j+1].n))
{
temp=stude[j];
stude[j]=stude[j+1];
stude[j+1]=temp;
}
for(int i=0;i<n;i++)
{
printf("%s\n",stude[i].name);
}
}
}