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

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个学生的信息，和按照哪一列排序
思路：注意的一点是当名字或者成绩相同的时候按照id递增排序

#include<iostream>
#include<cstdio>
#include<stack> 
#include<queue>
#include<vector>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<map>

using namespace std;

int n,c;

struct node {
	string id;
	string name;
	int grade;
};

bool cmp(node a,node b) {
	if(c == 1) {
		return a.id < b.id;
	} else if(c == 2) {
		return a.name == b.name ? (a.id < b.id) : (a.name < b.name);
	} else if(c == 3) {
		return a.grade == b.grade ? (a.id < b.id) : (a.grade < b.grade);
	}
}

int main() {
	scanf("%d%d",&n,&c);
	vector<node> v(n);
	string sid,sname;
	int sgrade;
	for(int i = 0;i < n;i++) {
		cin >> sid >> sname >> sgrade;
		v[i].id = sid;
		v[i].name = sname;
		v[i].grade = sgrade;
	}
	sort(v.begin(),v.end(),cmp);
	for(int i = 0;i < n;i++) {
		cout << v[i].id << " " << v[i].name << " " << v[i].grade << endl;
	}
	return 0;
}