pat-1028 List Sorting(25)（按要求排序）

 

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 (≤10​5​​) 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 90

Sample Output 3:

000001 Zoe 60
000007 James 85
000002 James 90
000010 Amy 90

作者: CHEN, Yue

单位: 浙江大学

时间限制: 400 ms

内存限制: 64 MB

代码长度限制: 16 KB

 

用cin会超时，最后一个测试点会过不了～ 

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
typedef struct{
    int s,id;
    char nm[20];
} node;
node a[100005];
bool cmp_id(node x,node y)
{
    return x.id < y.id;
}
bool cmp_nm(node x,node y)
{
    if(strcmp(x.nm,y.nm) < 0)
        return true;
    else if(strcmp(x.nm,y.nm) == 0){
        if(x.id < y.id)
            return true;
    }
    return false;
}
bool cmp_s(node x,node y)
{
    if(x.s != y.s)
        return x.s < y.s;
    else
        return x.id < y.id;
}
int main()
{
    
    int n,c;
    scanf("%d%d",&n,&c);
    for(int i = 0 ; i < n;i++)
        scanf("%d%s%d",&a[i].id,a[i].nm,&a[i].s);
    switch(c)
    {
        case 1:
            sort(a,a + n,cmp_id);
            break;
        case 2:
            sort(a,a + n,cmp_nm);
            break;
        case 3:
            sort(a,a + n,cmp_s);
            break;
        default:
            break;
    }
    for(int i = 0 ; i < n;i++)
    {
        printf("%06d %s %d\n",a[i].id,a[i].nm,a[i].s);
    }
    return 0;
}