A1028 List Sorting (25分)【C语言】

A1028 List Sorting (25分)【C语言】

原题链接

注意ID在输入的时候前面的0不会被存储，因此应该注意输出格式，控制0的输出。

题目描述：
Excel can sort records according to any column. Now you are supposed to imitate this function.

输入格式：
Each input file contains one test case. For each case, the first line contains two integers N (≤10 ​5​​ ) and C, where N is the number of records and C is the column that you are supposed to sort the records with. Then N lines follow, each contains a record of a student. A student’s record consists of his or her distinct ID (a 6-digit number), name (a string with no more than 8 characters without space), and grade (an integer between 0 and 100, inclusive).

输出格式：
For each test case, output the sorting result in N lines. That is, if C = 1 then the records must be sorted in increasing order according to ID’s; if C = 2 then the records must be sorted in non-decreasing order according to names; and if C = 3 then the records must be sorted in non-decreasing order according to grades. If there are several students who have the same name or grade, they must be sorted according to their ID’s in increasing order.

输入样例1：

3 1
000007 James 85
000010 Amy 90
000001 Zoe 60

输出样例1：

000001 Zoe 60
000007 James 85
000010 Amy 90

输入样例2：

4 2
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 98

输出样例2：

000010 Amy 90
000002 James 98
000007 James 85
000001 Zoe 60

输入样例3：

4 3
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 90

输出样例3：

000001 Zoe 60
000007 James 85
000002 James 90
000010 Amy 90

实现代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
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, c, i;
	scanf("%d %d", &n, &c);
	for(i=0; i<n; ++i){
		scanf("%d %s %d", &stu[i].id, stu[i].name, &stu[i].score);
	}
	if(c==1) sort(stu, stu+n, cmp1);
	else if(c==2) sort(stu, stu+n, cmp2);
	else sort(stu, stu+n, cmp3);
	for(i=0; i<n; ++i){
		printf("%06d %s %d\n", stu[i].id, stu[i].name, stu[i].score);
	}
	
	return 0;
}