PAT a1028题解

#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

struct Student{
	int id;
	char name[10];
	int score;
}stu[100010];

bool cmp1(Student a, Student b){
	return a.id < b.id; 
} 

bool cmp2(Student a, Student b){
	int s = strcmp(a.name, b.name);
	if(s != 0) return s < 0;
	else return a.id < b.id; 
}

bool cmp3(Student a, Student b){
	if(a.score != b.score) return a.score < b.score;
	else return a.id < b.id;  
}

int main(){
	int n, m;
	scanf("%d%d", &n, &m);
	for(int i = 0; i < n; i++){
		scanf("%d %s %d", &stu[i].id, stu[i].name, &stu[i].score);
	}
	if(m == 1){
		sort(stu, stu + n, cmp1);
	}
	else if(m == 2){
		sort(stu, stu + n, cmp2);
	}
	else if(m == 3){
		sort(stu, stu + n, cmp3);
	}
	for(int i = 0; i < n; i++){
		printf("%06d %s %d\n", stu[i].id, stu[i].name, stu[i].score);
	}
	return 0;
}