PAT甲级 1028

题目 List Sorting

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.

解析

输入n个学生，按c列排序。如果成绩、姓名相同按学号排序

代码

#include<bits/stdc++.h>

#define INF 1<<29

using namespace std;

struct student {
    int id;
    string name;
    int grade;
};

int n, c;
vector<student> students;

bool cmp1(student s1, student s2) {
    return s1.id < s2.id;
}

bool cmp2(student s1, student s2) {
    if (s1.name.compare(s2.name) == 0) {
        return s1.id < s2.id;
    }
    return s1.name.compare(s2.name) < 0;
}

bool cmp3(student s1, student s2) {
    if (s1.grade == s2.grade) {
        return s1.id < s2.id;
    }
    return s1.grade < s2.grade;
}

void pat1028() {
    cin >> n >> c;
    for (int i = 0; i < n; ++i) {
        int id, grade;
        string name;
        cin >> id >> name >> grade;
        student s = {
                id, name, grade
        };
        students.push_back(s);
    }

    switch (c) {
        case 1: {
            sort(students.begin(), students.end(), cmp1);
            break;
        }
        case 2: {
            sort(students.begin(), students.end(), cmp2);
            break;
        }
        case 3: {
            sort(students.begin(), students.end(), cmp3);
            break;
        }
    }

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


int main() {
    pat1028();
    return 0;
}