1028. List Sorting (25)【排序】——PAT (Advanced Level) Practise

题目信息

1028. List Sorting (25)

时间限制200 ms
内存限制65536 kB
代码长度限制16000 B

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
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 90
Sample Output 3
000001 Zoe 60
000007 James 85
000002 James 90
000010 Amy 90

解题思路

排序

AC代码

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct node{
    char name[10];
    int id, score;
}lst[100005];
bool cmp1(const node& a, const node& b){
    return a.id < b.id;
}
bool cmp2(const node& a, const node& b){
    int t = strcmp(a.name, b.name);
    if (t == 0) return a.id < b.id;
    return 0 > t;
}
bool cmp3(const node& a, const node& b){
    if (a.score == b.score) return a.id < b.id;
    return a.score < b.score;
}
int main()
{
    int n, k;
    char name[10];
    int id, score;
    scanf("%d%d", &n, &k);
    for (int i = 0; i < n; ++i){
        scanf("%d%s%d", &lst[i].id, lst[i].name, &lst[i].score);
    }
    if (k == 1) sort(lst, lst + n, cmp1);
    if (k == 2) sort(lst, lst + n, cmp2);
    if (k == 3) sort(lst, lst + n, cmp3);
    for (int i = 0; i < n; ++i){
        printf("%06d %s %d\n", lst[i].id, lst[i].name, lst[i].score);
    }
    return 0;
}