Start: Mar, 06, 2018 09:46:00
计算机161 算法分析与设计 第一次实验课作业(吴银杰、张凯庆)
End: Mar, 10, 2018 10:00:00
Time elapsed:
Time remaining:

Problem_ID: F
Result: Accepted
Time: 12ms
Memory: 1096kB
Author: Dew
In contest: 1141

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
typedef struct{
	char a[31];
	int score1;
	int score2;
	int add;
}finalexam;
finalexam student[101]; 
int comp(const void *a,const void *b)
{
	finalexam *aa=(finalexam *)a;
	finalexam *bb=(finalexam *)b;
	return (bb->add)-(aa->add);
}
int main(void){
	int t;
	scanf("%d",&t);
	while(t--){
		int n;
		scanf("%d",&n);
		for(int i=0;i<n;i++){
			scanf("%s %d %d",student[i].a,&student[i].score1,&student[i].score2);
			student[i].add=student[i].score1+student[i].score2;
		}
		qsort(student,n,sizeof(student[0]),comp);
		for(int i=0;i<n;i++){
			puts(student[i].a);
		}
	}
	return 0;
}