1028 List Sorting (25 分)——PAT A

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

【分析】排序题

总结：

non-decreasing 非降序用 <= ;

increasing 用 < .

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 1e5 +5;
struct student {
    string id;
    string name;
    int grade;
};
student S[maxn];
int n, c;
bool cmp1(student a, student b) {
    return a.id < b.id;
}
bool cmp2(student a, student b) {
    return a.name <= b.name;
}
bool cmp3(student a, student b) {
    if (a.grade != b.grade) return a.grade < b.grade;
    else return a.id < b.id;
}
void solve(int c) {
    if (c == 1) {
        sort(S, S + n, cmp1);
    } else if (c == 2) {
        sort(S, S + n, cmp2);
    } else if (c == 3) {
        sort(S, S + n, cmp3);
    }
    for (int i = 0; i < n; i++) {
        cout << S[i].id << " " << S[i].name << " " << S[i].grade;
        printf("%s", i != n - 1 ? "\n" : "");
    }
}
int main(){
    cin >> n >> c;
    for (int i = 0; i < n; i++) {
        cin >> S[i].id >> S[i].name >> S[i].grade;
    }
    solve(c);
    return 0;
}

1