1028 List Sorting (25)（25 分）

80 阅读 0 评论 53 点赞

我是靠谱客的博主认真大侠，这篇文章主要介绍1028 List Sorting (25)（25 分），现在分享给大家，希望可以做个参考。

1028 List Sorting (25)（25 分）
Excel can sort records according to any column. Now you are supposed to imitate this function.

Input

Each input file contains one test case. For each case, the first line contains two integers N (<=100000) 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

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

复制代码

1
2
3
4
3 1
000007 James 85
000010 Amy 90
000001 Zoe 60

Sample Output 1

复制代码

1
2
3
000001 Zoe 60
000007 James 85
000010 Amy 90

Sample Input 2

复制代码

1
2
3
4
5
4 2
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 98

Sample Output 2

复制代码

1
2
3
4
000010 Amy 90
000002 James 98
000007 James 85
000001 Zoe 60

Sample Input 3

复制代码

1
2
3
4
5
4 3
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 90

Sample Output 3

复制代码

1
2
3
4
000001 Zoe 60
000007 James 85
000002 James 90
000010 Amy 90

题目大意:给出n个考生的准考证号，姓名，分数，输入参数c，并按照c的不同取值进行排序。

分析：根据c的不同取值，可以直接写3个cmp比较函数，按需调用排序即可

复制代码

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 100010;
struct Student {
    int id;
    char name[10];
    int score;
}stu[maxn];
bool cmp1(Student a, Student b) {
    return a.id < b.id;
}
bool cmp2(Student a, Student b) {
    int s = strcmp(a.name, b.name);
    if(s != 0) {
        return s < 0;
    } else {
        return a.id < b.id;
    }
}
bool cmp3(Student a, Student b) {
    if(a.score != b.score) {
        return a.score < b.score;
    } else {
        return a.id < b.id;
    }
}
int main() {
    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].score);
    }
    if(c == 1) {
        sort(stu, stu + n, cmp1);
    } else if(c == 2) {
        sort(stu, stu + n, cmp2);
    } else {
        sort(stu, stu + n, cmp3);
    }
    for(int i = 0; i < n; i++) {
        printf("%06d %s %dn", stu[i].id, stu[i].name, stu[i].score);
    }
    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 100010;
struct Student {
    int id;
    char name[10];
    int score;
}stu[maxn];
bool cmp1(Student a, Student b) {
    return a.id < b.id;
}
bool cmp2(Student a, Student b) {
    int s = strcmp(a.name, b.name);
    if(s != 0) {
        return s < 0;
    } else {
        return a.id < b.id;
    }
}
bool cmp3(Student a, Student b) {
    if(a.score != b.score) {
        return a.score < b.score;
    } else {
        return a.id < b.id;
    }
}
int main() {
    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].score);
    }
    if(c == 1) {
        sort(stu, stu + n, cmp1);
    } else if(c == 2) {
        sort(stu, stu + n, cmp2);
    } else {
        sort(stu, stu + n, cmp3);
    }
    for(int i = 0; i < n; i++) {
        printf("%06d %s %dn", stu[i].id, stu[i].name, stu[i].score);
    }
    return 0;
}