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
^{5}
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 9
Sample Output 3:
000002 James 9
000001 Zoe 60
000007 James 85
000010 Amy 90
利用algorithm库中sort排序,编写结构体排序函数
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
struct Student {
string id;
string name;
int score;
};
bool compare1(Student A, Student B) {
return A.id < B.id;
}
bool compare2(Student A, Student B) {
if (A.name == B.name) return A.id < B.id;
return A.name < B.name;
}
bool compare3(Student A, Student B) {
if (A.score == B.score) return A.id < B.id;
return A.score < B.score;
}
int main() {
Student s[100001];
int n, t;
cin >> n >> t;
for (int i = 0; i < n; i++)
cin >> s[i].id >> s[i].name >> s[i].score;
if (t == 1) sort(s, s+n, compare1);
if (t == 2) sort(s, s+n, compare2);
if (t == 3) sort(s, s+n, compare3);
for (int i = 0; i < n; i++)
cout << s[i].id << " " << s[i].name << " " << s[i].score << endl;
return 0;
}
欢迎指导和交流!