1028 List Sorting (25 分)--PAT甲级

最新推荐文章于 2022-09-13 21:25:31 发布

WananRd

最新推荐文章于 2022-09-13 21:25:31 发布

阅读量72

点赞数

分类专栏： # PAT

本文链接：https://blog.csdn.net/weixin_51173281/article/details/119722733

版权

C++ 排序结构体 Excel 比较函数

关键词由CSDN通过智能技术生成

PAT 专栏收录该内容

91 篇文章 1 订阅

订阅专栏

QuestionDescribe:
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^5 ) 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

题目分析：很简单的排序题

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