1028 List Sorting (25分)

测试地址：☞

Excel can sort records according to any column. Now you are supposed to imitate this function.

Input Specification:

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 Nlines 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).

Output Specification:

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.

Sample Input 1:

3 1
000007 James 85
000010 Amy 90
000001 Zoe 60

Sample Output 1:

000001 Zoe 60
000007 James 85
000010 Amy 90

Sample Input 2:

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

Sample Output 2:

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

Sample Input 3:

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

Sample Output 3:

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

【题意】

给出 n 和 c，之后 n 行每行给出 id，姓名，成绩

当 c==1 时，按 id 排序；当 c==2 时，按姓名排序；当 n==3 时，按成绩排序；如果姓名和成绩相同，则按 id 号排序；

【思路】

对 c=1，2，3 时分别进行排序；排序要写在一个函数里，不能写三个排序函数，会超时；

【AC代码】 

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1e5+7;
int n, c;
struct num{
	string id, name;
	int score;
};
num a[maxn];
int cmp(num a, num b){
	if(c == 1)	return a.id < b.id;
	else if(c == 2){
		if(a.name == b.name)	return a.id < b.id;
		return a.name < b.name;
	}
	else if(c == 3){
		if(a.score == b.score)	return a.id < b.id;
		return a.score < b.score;
	}
}
int main(){
	cin >> n >> c;
	for(int i = 0; i < n; i++)
		cin >> a[i].id >> a[i].name >> a[i].score;
	sort(a, a+n, cmp);
	for(int i = 0; i < n; i++)
		cout << a[i].id << " " << a[i].name << " " << a[i].score << endl;
	return 0;
}