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
相关推荐
取加若则_4 小时前
Linux进程调度:双队列高效管理
linux·算法
Tisfy5 小时前
LeetCode 961.在长度 2N 的数组中找出重复 N 次的元素:5种语言x5种方法(及其变种) —— All By Hand
数据结构·数学·算法·leetcode·题解
小O的算法实验室6 小时前
2024年ESWA SCI1区TOP,容错文化概率粒子群算法+多 AGV 路径规划,深度解析+性能实测
算法·论文复现·智能算法·智能算法改进
WW_千谷山4_sch6 小时前
洛谷P1120&UVA307 [CERC 1995] 小木棍
c++·算法·深度优先
XLYcmy7 小时前
高级密码猜测生成器AdvancedPasswordGenerator密码生成器程序详细分析
开发语言·python·算法·网络安全·开发工具·源代码·口令安全
STY_fish_20128 小时前
可持久化线段树
数据结构
im_AMBER8 小时前
Leetcode 93 找出临界点之间的最小和最大距离
c++·笔记·学习·算法·leetcode
有一个好名字8 小时前
力扣:除自身以外数组的乘积
java·算法·leetcode
bkspiderx9 小时前
C++中的访问控制:private、public与protected的深度解析
开发语言·c++·算法·访问控制·private·public·protected
ullio9 小时前
arc207c - Combine to Make Non-decreasing
算法