1028 List Sorting

最新推荐文章于 2025-12-10 19:39:18 发布

原创最新推荐文章于 2025-12-10 19:39:18 发布 · 259 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #算法 #数据结构

PAT (Advanced Level) Practice 专栏收录该内容

59 篇文章

订阅专栏

本文介绍了一个模仿Excel排序功能的程序设计案例，根据指定的列对学生记录进行排序，支持按ID、姓名或成绩的不同方式进行排序。

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 (≤105) 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

题目大意

给你N个学生的 ID name score，根据输入的排序要求key进行排序

1. 根据ID升序

2. 根据名字升序，注意名字相同时按分数降序

3. 根据分数升序，注意分数相同时按ID升序

思路

建立学生结构体，然后sort排序

C/C++

#include<bits/stdc++.h>
using namespace std;
struct Student{
    string id,name;
    int score;
}s;
vector<Student> all;
int N,key;
bool cmp(const Student& x,const Student& y ){
    if(key==1) return x.id < y.id;
    if(key==2) return x.name != y.name ? x.name<y.name : x.score > y.score;
    return x.score != y.score ? x.score < y.score : x.id < y.id;
}
int main()
{
    cin >> N >> key;
    while (N--){
        cin >> s.id >> s.name >> s.score;
        all.push_back(s);
    }

    sort(all.begin(),all.end(),cmp);
    for(const Student& x:all){
        cout << x.id << " " << x.name << " " << x.score << endl;
    }
    return 0;
}