1028 List Sorting （25 分）（排序，STL应用）

最新推荐文章于 2020-01-29 22:07:15 发布

virgilshi

最新推荐文章于 2020-01-29 22:07:15 发布

阅读量550

点赞数 1

CC 4.0 BY-SA版权

分类专栏： PAT 甲级文章标签： PAT 甲级

本文链接：https://blog.youkuaiyun.com/whutshiliu/article/details/83096237

PAT 甲级专栏收录该内容

47 篇文章

订阅专栏

本文介绍了一个使用C++实现的学生记录排序算法，该算法能够根据ID、姓名或成绩进行排序，适用于处理大量学生数据的场景。文章提供了完整的代码示例，包括输入输出规范，以及三个示例输入和对应的输出结果。

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

1028 List Sorting （25 分）（排序，STL应用）

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 (≤10⁵ ) 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 90
Sample Output 3:
000001 Zoe 60
000007 James 85
000002 James 90
000010 Amy 90

#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
struct node {
    int id,grade;
    string name;
};
int n,c,i;
bool cmp(node a,node b) {
    if(c==1) return a.id<b.id;
    else if(c==2) return a.name!=b.name?a.name<b.name:a.id<b.id;
    else return a.grade!=b.grade?a.grade<b.grade:a.id<b.id;
}
int main() {
    scanf("%d %d",&n,&c);
    vector<node> v(n);
    for(i=0; i<n; i++) {
        cin>>v[i].id>>v[i].name>>v[i].grade;
    }
    sort(v.begin(),v.end(),cmp);
    for(auto it : v){
        printf("%06d %s %d\n",it.id,it.name.c_str(),it.grade);
    }
}