题解 | #EXCEL排序#

#include <iostream>
#include <algorithm>
using namespace std;

struct Student{
    string id;
    string name;
    int score;
};

bool com1(Student a,Student b){
    return a.id<b.id;
}

bool com2(Student a,Student b){
    if(a.name==b.name) return a.id<b.id;
    else return a.name<b.name;
}

bool com3(Student a,Student b){
    if(a.score==b.score) return a.id<b.id;
    return a.score<b.score;
}


int main() {
    int n,c;
    cin>>n>>c;
    Student student[n];
    for(int i=0;i<n;i++){
        cin>>student[i].id>>student[i].name>>student[i].score;
    }
    if(c==1){
        sort(student,student+n,com1);
    }
    else if(c==2){
        sort(student,student+n,com2);
    }
    else if(c==3){
        sort(student,student+n,com3);
    }
    cout<<"Case:"<<endl;
    for(int i=0;i<n;i++){
        cout<<student[i].id<<" "<<student[i].name<<' '<<student[i].score<<endl;
    }
    }

// 64 位输出请用 printf("%lld")