Result: Accepted
Time: 12ms
Memory: 1728kB
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
struct student
{
char name[40];
int lilun;
int shijian;
int sum;
}stu[150];
bool compare(student a,student b)
{
return a.sum>b.sum;
}
int main()
{
int T,n,i,numble,sum;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d",stu[i].name,&stu[i].lilun,&stu[i].shijian);
stu[i].sum=stu[i].lilun+stu[i].shijian;
}
sort(stu,stu+n,compare);
for(i=0;i<n;i++)
{
printf("%s",stu[i].name);
printf("\n");
}
}
return 0;
}