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
相关推荐
智者知已应修善业1 小时前
【求中位数】2024-1-23
c语言·c++·经验分享·笔记·算法
地平线开发者1 小时前
PTQ 量化数值范围与优化
算法·自动驾驶
sali-tec1 小时前
C# 基于halcon的视觉工作流-章68 深度学习-对象检测
开发语言·算法·计算机视觉·重构·c#
测试人社区-小明2 小时前
智能弹性伸缩算法在测试环境中的实践与验证
人工智能·测试工具·算法·机器学习·金融·机器人·量子计算
罗西的思考2 小时前
【Agent】MemOS 源码笔记---(5)---记忆分类
人工智能·深度学习·算法
qq_433554545 小时前
C++数位DP
c++·算法·图论
AshinGau6 小时前
Softmax 与 交叉熵损失
神经网络·算法
似水এ᭄往昔6 小时前
【C++】--AVL树的认识和实现
开发语言·数据结构·c++·算法·stl
栀秋6666 小时前
“无重复字符的最长子串”:从O(n²)哈希优化到滑动窗口封神,再到DP降维打击!
前端·javascript·算法
xhxxx6 小时前
不用 Set,只用两个布尔值:如何用标志位将矩阵置零的空间复杂度压到 O(1)
javascript·算法·面试