PAT-A1028-List Sorting

PAT List Sorting - 题目链接

---

题目描述

 Excel can sort records according to any column. Now you are supposed to imitate this function.

输入描述

 Each input file contains one test case. For each case, the first line contains two integers N (≤10 e5) 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).

输出描述

 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.

---

示例：

输入

3 1
000007 James 85
000010 Amy 90
000001 Zoe 60

输出

000001 Zoe 60
000007 James 85
000010 Amy 90

输入

4 2
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 98

输出

000010 Amy 90
000002 James 98
000007 James 85
000001 Zoe 60

输入

4 3
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 9

输出

000002 James 9
000001 Zoe 60
000007 James 85
000010 Amy 90

---

解题思路

 1.在题目中是有三种排序方式的 我们只需要根据要求编写三种不同的cmp函数就可以了
 2.根据题目输入的排序方式调用对应的sort，最后输出结构
 3.值得注意的是最后准考证号的输出部分 是%06d

参考代码

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

struct Student {
    int id;
    char name[20];
    int grade;
} Student[100005];

bool cmp_1(struct Student a, struct Student b) {
    return a.id < b.id;
}

bool cmp_2(struct Student a, struct Student b) {
    if (strcmp(a.name, b.name) != 0) {
        return strcmp(a.name,b.name) <0;
    } else {
        return a.id < b.id;
    }
}

bool cmp_3(struct Student a, struct Student b) {
    if (a.grade != b.grade) {
        return a.grade < b.grade;
    } else {
        return a.id < b.id;
    }
}

int main() {
    int m, n;
    scanf("%d %d", &m, &n);
    for (int i = 0; i < m; ++i) {
        scanf("%d %s %d", &Student[i].id, Student[i].name, &Student[i].grade);
    }
    if (n == 1) {
        sort(Student, Student + m, cmp_1);
    } else if (n == 2) {
        sort(Student, Student + m, cmp_2);
    } else {
        sort(Student, Student + m, cmp_3);
    }
    for (int i = 0; i < m; ++i) {
        printf("%06d %s %d\n", Student[i].id, Student[i].name, Student[i].grade);
    }
    return 0;
}