PATA1028题解

简单排序题

//
//  main.cpp
//  PATA1028
//
//  Created by Phoenix on 2018/2/7.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

struct Student {
    int id;
    char name[10];
    int grade;
}stu[100010];

bool cmp1(Student a, Student b) {
    return a.id < b.id;
}

bool cmp2(Student a, Student b) {
    if(strcmp(a.name, b.name) != 0) return strcmp(a.name, b.name) < 0;
    else return a.id < b.id;
}

bool cmp3(Student a, Student b) {
    if(a.grade != b.grade) return a.grade < b.grade;
    else return a.id < b.id;
}

int main(int argc, const char * argv[]) {
    int n, c;
    scanf("%d %d", &n, &c);
    for(int i = 0; i < n; i++) {
        scanf("%d %s %d", &stu[i].id, stu[i].name, &stu[i].grade);
    }
    if(c == 1) sort(stu, stu + n, cmp1);
    else if(c == 2) sort(stu, stu + n, cmp2);
    else if(c == 3) sort(stu, stu + n, cmp3);
    for(int i = 0; i < n; i++) {
        printf("%06d %s %d\n", stu[i].id, stu[i].name, stu[i].grade);
    }
    return 0;
}