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
相关推荐
王璐WL1 分钟前
【数据结构】单链表的经典算法题
数据结构·算法
m0_495562783 分钟前
Swift-Enum
java·算法·swift
青山的青衫6 分钟前
【前后缀】Leetcode hot 100
java·算法·leetcode
Zzzzmo_20 分钟前
Java数据结构:二叉树
java·数据结构·算法
CoovallyAIHub26 分钟前
结构化数据迎来“ChatGPT时刻”!LimitX:一个模型统一所有表格任务
深度学习·算法·计算机视觉
普普通通的南瓜44 分钟前
网站提示 “不安全”?免费 SSL 证书一键解决
网络·数据库·网络协议·算法·安全·iphone·ssl
聆风吟º1 小时前
【数据结构入门手札】数据结构基础:从数据到抽象数据类型
数据结构·数据类型·逻辑结构·数据对象·物理结构·数据项·数据元素
啊吧怪不啊吧1 小时前
二分查找算法介绍及使用
数据结构·算法·leetcode
知识搬运工人1 小时前
对比 DeepSeek(MLA)、Qwen 和 Llama 系列大模型在 Attention 架构/算法层面的核心设计及理解它们的本质区别。
算法
修行者Java2 小时前
JVM 垃圾回收算法的详细介绍
jvm·算法