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

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <cctype>
#include <string.h>
#include <cstdio>
using namespace std;
struct node{
    int id,grade;
    string name;
};
bool cmp1(node a,node b){
    return a.id<b.id;
}
bool cmp2(node a,node b){
    if(a.name==b.name) return a.id<b.id;
    else return a.name<b.name;
}
bool cmp3(node a,node b){
    if(a.grade==b.grade) return a.id<b.id;
    else return a.grade<b.grade;
}
int main(){
    int n,c;
    scanf("%d %d",&n,&c);
    vector<node> stu(n);
    for(int i=0;i<n;i++){
        scanf("%d",&stu[i].id);
        cin>>stu[i].name;
        scanf("%d",&stu[i].grade);
    }
    if(c==1) sort(stu.begin(),stu.end(),cmp1);
    else if(c==2) sort(stu.begin(),stu.end(),cmp2);
    else if(c==3) sort(stu.begin(),stu.end(),cmp3);
    for(int i=0;i<stu.size();i++){
        printf("%06d ",stu[i].id);
        cout<<stu[i].name;
        printf(" %d\n",stu[i].grade);
    }
    return 0;
}