Result: Accepted
Time: 575ms
Memory: 1844kB
#include "stdio.h"
#include <algorithm>
#include <iostream>
using namespace std;
typedef struct
{
int s;
char str[31];
}stu;
int comp(const void *a,const void *b)
{
return ((stu *)b)->s-((stu *)a)->s;
}
int main()
{
int t;
int n;
int s1,s2;
scanf("%d",&t);
while(t--)
{
cin>>n;
stu *stus=new stu[n];
for(int i=0;i<n;i++)
{
getchar();
cin>>stus[i].str>>s1>>s2;
stus[i].s=s1+s2;
}
qsort(&(stus->s),n,sizeof(stu),comp);
for(int i=0;i<n;i++)
{
cout<<stus[i].str<<endl;
}
}
return 0;
}