PAT 1028 List Sorting

最新推荐文章于 2022-05-23 22:24:12 发布

漂流瓶终结者

最新推荐文章于 2022-05-23 22:24:12 发布

阅读量106

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构

本文链接：https://blog.youkuaiyun.com/ZCMU_2024/article/details/84571481

数据结构专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一个基于C++的排序算法实现，该算法能够根据指定的列对学生记录进行排序，包括学生ID、姓名和成绩。通过使用自定义的比较函数和标准模板库中的sort函数，可以实现在不同列上的排序需求，同时确保了当姓名或成绩相同时，按ID升序排列。

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

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 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<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAX=1e5+5;
struct node{
  char number[10];
  char name[10];
  int grade;
}e[MAX];
bool type_1(node x,node y)
{
    return strcmp(x.number,y.number)<0?1:0;
}
bool type_2(node x,node y)
{
    int r=strcmp(x.name,y.name);
     if(r==0)
        return strcmp(x.number,y.number)<0?1:0;
     else
        return r<0?1:0;
}
bool type_3(node x,node y)
{
    if(x.grade==y.grade)
        return strcmp(x.number,y.number)<0?1:0;
    else
        return x.grade<y.grade;
}
int main()
{
    int N,type;
    scanf("%d%d",&N,&type);
    for(int i=0;i<N;i++)
    {
        scanf("%s %s %d",e[i].number,e[i].name,&e[i].grade);
    }
    switch(type)
    {
        case 1:sort(e,e+N,type_1);break;
        case 2:sort(e,e+N,type_2);break;
        case 3:sort(e,e+N,type_3);break;
    }
    for(int i=0;i<N;i++)
    {
        if(i==0)
           printf("%s %s %d",e[i].number,e[i].name,e[i].grade);
        else
           printf("\n%s %s %d",e[i].number,e[i].name,e[i].grade);
    }
    return 0;
}