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
相关推荐
apcipot_rain1 小时前
计科八股20260616(1)——堆存中位数、链表判环、黑白测试、敏捷开发与瀑布模型、配置管理、持续集成、池化
数据结构·算法·软件工程
JAVA面经实录9177 小时前
Java 数据结构与算法 (终极完整学习文档)
java·数据结构·算法
开源Z9 小时前
LeetCode 42 · 接雨水:从暴力到双指针的三步优化
算法·leetcode
旖-旎9 小时前
《LeetCode 695 岛屿的最大面积 FloodFill DFS 解法》
c++·算法·力扣·深度优先遍历·floodfill
影视飓风TIM9 小时前
数据结构 | 链表超全笔记(单链表+双链表+高频算法题)
数据结构·笔记·链表
syagain_zsx10 小时前
STL 之 vector 讲练结合
c++·算法
牛油果子哥q10 小时前
STL set与map底层精讲,红黑树适配原理、有序去重特性、迭代器遍历、API实战与面试核心考点全解
开发语言·数据结构·c++·面试
MartinYeung511 小时前
[论文学习]DP2Unlearning:高效且具保证的大型语言模型遗忘框架(基于差分隐私的 LLM Unlearning 方法)
学习·算法·语言模型
Tian_Hang11 小时前
C++原型模式(Protype)
开发语言·c++·算法