1028 List Sorting (PAT甲级)

cpp 复制代码
#include <cstdio>
#include <vector>
#include <algorithm>
#include <string>

struct stu{
    int id;
    std::string name;
    int grade;
};

int N, C;
char name[9];
std::vector<stu> vec;

bool cmp(const stu &a, const stu &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);
    vec.resize(N);
    for(int i = 0; i < N; ++i){
        scanf("%d %s %d", &vec[i].id, name, &vec[i].grade);
        vec[i].name = name;
    }
    sort(vec.begin(), vec.end(), cmp);
    for(int i = 0; i < N; ++i){
        printf("%06d %s %d\n", vec[i].id, vec[i].name.c_str(), vec[i].grade);
    }
    return 0;
}

题目如下:

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 9

Sample Output 3:

复制代码
000002 James 9
000001 Zoe 60
000007 James 85
000010 Amy 90
相关推荐
稚辉君.MCA_P8_Java17 分钟前
DeepSeek Java 插入排序实现
java·后端·算法·架构·排序算法
池塘的蜗牛21 分钟前
NR系统相位补偿的原因与原理
算法
树在风中摇曳1 小时前
链表五大经典面试题详解:双指针与基础操作实战
数据结构·链表
Sɪʟᴇɴᴛ໊ོ2351 小时前
Anyview数据结构第一章(按需自取)
c语言·开发语言·数据结构·算法
松岛雾奈.2301 小时前
机器学习--数据集的标准化和归一化算法;随机森林
人工智能·算法·机器学习
橘颂TA1 小时前
【剑斩OFFER】算法的暴力美学——丢失的数字
数据结构·算法·leetcode·结构与算法
努力的白熊嗨1 小时前
大文件 Hash 计算:Web Worker 并行优化的原理与局限性
javascript·算法
CoovallyAIHub2 小时前
存储风暴下的边缘智能韧性:瑞芯微RK3588如何将供应链挑战转化为市场机遇
深度学习·算法·计算机视觉
杜子不疼.2 小时前
【C++】解决哈希冲突的核心方法:开放定址法 & 链地址法
c++·算法·哈希算法
落羽的落羽2 小时前
【Linux系统】解明进程优先级与切换调度O(1)算法
linux·服务器·c++·人工智能·学习·算法·机器学习