1028 List Sorting (25 分)

最新推荐文章于 2025-12-12 16:37:00 发布

原创最新推荐文章于 2025-12-12 16:37:00 发布 · 124 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#c++ #PAT

PAT 甲级专栏收录该内容

34 篇文章

订阅专栏

该博客介绍了一个C++程序，该程序模仿Excel的功能，根据用户指定的列（ID、姓名或成绩）对学生成绩记录进行升序或降序排序。程序首先读取输入的记录数和排序依据列，然后对每个学生记录进行处理，包括ID、姓名和成绩。利用自定义的比较函数`cmp`，根据给定的列进行排序，最后输出排序后的结果。

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 (≤105) and C, where N is the number of records and Cis 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

Analysis

签到题不多说。

Code(C++)

#include <iostream>
#include <algorithm>
using namespace std;

struct NODE {
    string id;
    int score;
    string name;
}node[100001];
int c;

int cmp(NODE a, NODE b)
{
    if(c == 1)
        return a.id < b.id;
    else if(c == 2)
    {
        if(a.name == b.name)
            return a.id < b.id;
        return a.name < b.name;
    }
    else
    {
        if(a.score == b.score)
            return a.id < b.id;
        return a.score <= b.score;
    }
}

int main()
{
    int n;
    cin >> n >> c;
    
    for(int i=0; i<n; i++)
        cin >> node[i].id >> node[i].name >> node[i].score;
    
    sort(node, node+n, cmp);
    
    for(int i=0; i<n; i++)
        cout << node[i].id << " " << node[i].name << " " << node[i].score << endl;
    return 0;
}