【PAT】A1028 List Sorting【排序】

最新推荐文章于 2024-09-13 21:25:40 发布

昵称五个字

最新推荐文章于 2024-09-13 21:25:40 发布

阅读量630

点赞数 2

分类专栏： PAT

本文链接：https://blog.csdn.net/a617976080/article/details/89892292

版权

PAT 专栏收录该内容

163 篇文章

订阅专栏

该博客介绍了一个编程问题，要求根据指定的列(C=1,2,3)对学生的学号、姓名或成绩进行排序。如果C=1，则按学号升序排序；C=2，按姓名非降序排序，相同姓名按学号升序；C=3，按成绩非降序排序，相同成绩按学号升序。提供了多个示例输入和对应的输出结果。" 81127477,7865980,XPath 基础教程：节点、路径表达式与选取技巧,"['前端开发', 'XML处理', '数据抓取', 'XPath查询']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Input

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

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

题目大意

根据c的值是1还是2还是3，对相应的列排序。第一列（学号）升序，第二列（姓名）不降序，第三列（成绩）不降序。注意：姓名或者成绩相同时根据学号升序排序。

代码

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
struct Student{
    int code;
    int grade;
    char name[10];
} students[100000];
// 排序的列
int col;
bool cmp(Student s1, Student s2){
    if(col == 1){
        // 按第一列升序
        return s1.code < s2.code;
    }else if(col == 2){
        // 如果名字不同，则根据名字排序，否则按学号排序
        int cmp = strcmp(s1.name, s2.name);
        if(cmp != 0) return cmp <= 0;
        return s1.code < s2.code;
    }else{
        // 如果成绩不同，则根据成绩排序，否则按学号排序
        int cmp = s1.grade - s2.grade;
        if(cmp != 0) return cmp <= 0;
        return s1.code < s2.code;
    }
}
int main() {
    int n;
    scanf("%d %d", &n, &col);
    for(int i = 0; i < n; i++){
        scanf("%d %s %d", &students[i].code, students[i].name, &students[i].grade);
    }
    sort(students, students + n, cmp);
    for(int i = 0; i < n; i++)
        printf("%06d %s %d\n", students[i].code, students[i].name, students[i].grade);
    return 0;
}