[PAT] 1028. List Sorting (25)

最新推荐文章于 2023-07-17 19:25:43 发布

沧海漂游_

最新推荐文章于 2023-07-17 19:25:43 发布

阅读量212

点赞数

分类专栏： PAT刷题

本文链接：https://blog.youkuaiyun.com/lv1224/article/details/79319423

版权

PAT刷题专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一个简单的程序设计问题，即如何模仿Excel的排序功能。该程序读取学生的记录（包括ID、姓名和成绩），并根据指定的列对学生记录进行排序。提供了完整的实现代码，包括输入输出示例。

摘要生成于 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

解析

这道题目比较简单，但是使用cin和cout最后一个case会超时，所以只能采用scanf和printf，利用struct来存储数据，用sort排序，提高编程效率。

代码

#include <iostream>
#include <bits/stdc++.h>

using namespace std;

int now=1;

struct Student
{
    int id;
    string name;
    int score;
    Student(int sid,string sname,int sscore):id(sid),name(sname),score(sscore) {}
};

bool cmp(Student &v1,Student &v2){
    if(now==1) return v1.id<v2.id;
    else if(now==2){
        if(v1.name!=v2.name) return v1.name<v2.name;
        else return v1.id<v2.id;
    }
    else if(now==3){
        if(v1.score!=v2.score) return v1.score<v2.score;
        else return v1.id<v2.id;
    }
    return true;
}

int main()
{
    vector<Student> stu;
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++){
        int id,score;
        string name;
        scanf("%d",&id);
        cin>>name;
        scanf("%d",&score);
        stu.push_back(Student(id,name,score));
    }
    now=m;
    sort(stu.begin(),stu.end(),cmp);
    for(auto &v:stu){
        printf("%06d ",v.id);
        cout<<v.name;
        printf(" %d\n",v.score);
    }
    return 0;
}