• pat 1028


    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 (≤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 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:

    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

    题意:模拟excel按照要求排序记录

    思路:会sort函数就行

    代码如下:

    #include<cstdio>
    #include<algorithm>
    #include<vector>
    #include<cstring>
    using namespace std;
    typedef struct node{
        int id;
        char name[10];
        int score;
    }node;
    node stu[100005];
    bool cmp1(node a,node b){
        if(a.id<b.id)
            return true;
        else
            return false;
    }
    bool cmp2(node a,node b){
        if(strcmp(a.name,b.name)<0)
            return true;
        else if(strcmp(a.name,b.name)>0)
            return false;
        else
            return a.id<b.id;
    }
    bool cmp3(node a,node b){
        if(a.score!=b.score)
            return a.score<b.score;
        else
            return a.id<b.id;
    }
    int main(){
        int n,c;
        scanf("%d%d",&n,&c);
        for(int i=0;i<n;i++){
            scanf("%d%s%d",&stu[i].id,stu[i].name,&stu[i].score);
        }
        if(c==1){
            sort(&stu[0],&stu[n],cmp1);
        }
        else if(c==2){
            sort(&stu[0],&stu[n],cmp2);
        }
        else if(c==3){
            sort(&stu[0],&stu[n],cmp3);
        }
        for(int i=0;i<n;i++){
            printf("%06d %s %d
    ",stu[i].id,stu[i].name,stu[i].score);
        }
        return 0;
    }
  • 相关阅读:
    Codeforces Round #700 (Div. 2)
    2020-2021 ACM-ICPC Brazil Subregional Programming Contest
    Codeforces Round #699 (Div. 2)
    2021牛客寒假算法基础集训营3
    2021牛客寒假算法基础集训营1
    Educational Codeforces Round 103 (Rated for Div. 2)
    Codeforces Round #697 (Div. 3)
    Codeforces Round #696 (Div. 2)
    2017 ECNA Regional Contest
    spring的aop详解
  • 原文地址:https://www.cnblogs.com/foodie-nils/p/13370533.html
Copyright © 2020-2023  润新知