1926 Problem C: EXCEL排序

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct Student {
	int id;
	char name[10];
	int score;
} stu[100100];

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

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

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

int main() {
	int n,mode;
	int count = 1;
	while(scanf("%d%d",&n,&mode) != EOF) {
		if(n == 0) break;
		for(int i = 0; i < n; i++) {
			scanf("%d%s%d",&stu[i].id,stu[i].name,&stu[i].score);
		}

		switch(mode) {
			case 1:
				sort(stu,stu+n,cmp1);
				break;
			case 2:
				sort(stu,stu+n,cmp2);
				break;
			case 3:
				sort(stu,stu+n,cmp3);
				break;
		}
		
		printf("Case %d:\n",count);
		for(int i = 0; i < n; i++) {
			printf("%06d %s %d\n",stu[i].id,stu[i].name,stu[i].score);
		}
		
		count++;
	}
	
	return 0;
}