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 (≤105) 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
Code
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#pragma warning(disable:4996)
using namespace std;
struct Student
{
string id, name;
int score;
};
void sortAndPrint(vector<Student>& rvec, int col)
{
switch (col)
{
case 1:
sort(rvec.begin(), rvec.end(), [](const Student& s1, const Student& s2)->bool {
return s1.id < s2.id;
});
break;
case 2:
sort(rvec.begin(), rvec.end(), [](const Student& s1, const Student& s2)->bool {
return (s1.name == s2.name) ? (s1.id < s2.id) : (s1.name < s2.name);
});
break;
case 3:
sort(rvec.begin(), rvec.end(), [](const Student& s1, const Student& s2)->bool {
return (s1.score == s2.score) ? (s1.id < s2.id) : (s1.score < s2.score);
});
default:
break;
}
for (auto student : rvec)
{
cout << student.id << " " << student.name << " " << student.score << '\n';
}
}
int main()
{
int N, C;
scanf("%d%d", &N, &C);
vector<Student> record;
for (int i = 0; i < N; i++)
{
Student temp;
cin >> temp.id >> temp.name;
scanf("%d", &temp.score);
record.push_back(temp);
}
sortAndPrint(record, C);
return 0;
}
思路
注意非减(non-decreace)是非严格增。