PAT 1028 List Sorting（结构体排序）

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 (≤105) 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.

结构体排序，判断三种情况即可：

代码如下：

#include<iostream>
#include<algorithm>
using namespace std;
struct stu{
    string id;
    string name;
    int point;
}student[100000];
bool cmp1(stu U1,stu U2){
    return U1.id<U2.id;
}
bool cmp2(stu U1,stu U2){
    return U1.name<=U2.name;
}
bool cmp3(stu U1,stu U2){
    if(U1.point!=U2.point)
        return U1.point<=U2.point;
    else
        return U1.id<U2.id;       
}
int main()
{
    int N,C;
    cin>>N>>C;
    for(int i=0;i<N;i++){
        cin>>student[i].id>>student[i].name>>student[i].point;
    }
    if(C==1)
        sort(student,student+N,cmp1);
    else if(C==2)
        sort(student,student+N,cmp2);
    else if(C==3)
        sort(student,student+N,cmp3);
    for(int i=0;i<N;i++)
        cout<<student[i].id<<" "<<student[i].name<<" "<<student[i].point<<endl;
    return 0;
}

结果如下：