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

#include <iostream>
#include <algorithm>

using namespace std;
struct student {
    string id;
    string name;
    int grade;
} stu[100005];
int C;

bool cmp(student s1, student s2) {
    if (C == 1)
        return s1.id < s2.id;
    else if (C == 2) {
        if (s1.name != s2.name)
            return s1.name < s2.name;
        else
            return s1.id < s2.id;
    } else {
        if (s1.grade == s2.grade)
            return s1.id < s2.id;
        else
            return s1.grade < s2.grade;
    }
}

int main() {
    int N;
    iostream::sync_with_stdio(false);
    cin.tie(0);
    cin >> N >> C;
    for (int i = 0; i < N; ++i) {
        cin >> stu[i].id >> stu[i].name >> stu[i].grade;
    }
    sort(stu, stu + N, cmp);
    for (int i = 0; i < N; ++i) {
        cout << stu[i].id << " " << stu[i].name << " " << stu[i].grade << endl;
    }
    return 0;
}