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: 10ms
Memory: 1092kB
Author: 2016210401023
In contest: 1141

#include<stdio.h>
#include<stdlib.h>
#define size 100
struct student{
	char name[30];
	int n1,n2,total;
};
int comp(const void *p,const void*q){
	return((struct student *)q)->total-((struct student *)p)->total;
}
int main(void){
	struct student studentNumber[size];
	int n,m;
	char t[30];
	scanf("%d",&n);
	while(n--){
		scanf("%d",&m);
		for(int i=0;i<m;i++){
		    scanf("%s%d%d",studentNumber[i].name,&studentNumber[i].n1,&studentNumber[i].n2);
		    studentNumber[i].total=studentNumber[i].n1+studentNumber[i].n2;
		}
		qsort(studentNumber,m,sizeof(struct student),comp);
		for(int q=0;q<m;++q){
		    printf("%s\n",studentNumber[q].name);
		}
	}
}