【笨方法学PAT】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 Nis 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

二、题目大意

简单排序。

三、考点

排序

四、注意

1、简单排序。

五、代码

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
struct node {
	int id;
	string name;
	int grade;
};
bool cmp1(node n1, node n2) {
	return n1.id < n2.id;
}
bool cmp2(node n1, node n2) {
	if (n1.name != n2.name)
		return n1.name < n2.name;
	else
		return n1.id < n2.id;
}
bool cmp3(node n1, node n2) {
	if (n1.grade != n2.grade)
		return n1.grade < n2.grade;
	else
		return n1.id < n2.id;
}
int main() {
	//read
	int n, c;
	cin >> n >> c;
	vector<node> vec(n);
	for (int i = 0; i < n; ++i) {
		cin >> vec[i].id >> vec[i].name >> vec[i].grade;
	}

	//sort
	if (c == 1)
		sort(vec.begin(), vec.end(), cmp1);
	else if(c==2)
		sort(vec.begin(), vec.end(), cmp2);
	else
		sort(vec.begin(), vec.end(), cmp3);

	//output
	for (int i = 0; i < n; ++i)
		printf("%06d %s %d\n", vec[i].id, vec[i].name.c_str(), vec[i].grade);

	system("pause");
	return 0;
}