PAT甲题题解-1028. List Sorting (25)-水排序

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <cmath>
#include <queue>
using namespace std;

/*
水排序
*/
const int maxn=100000+5;
int n,c;

struct Stu{
    int ID;
    char name[10];
    int grade;
}stu[maxn];

bool cmpID(Stu s1,Stu s2){
    return s1.ID<s2.ID;
}
bool cmpName(Stu s1,Stu s2){
    if(strcmp(s1.name,s2.name)==0)
        return s1.ID<s2.ID;
    else if(strcmp(s1.name,s2.name)<0)
        return true;
    else
        return false;
}

bool cmpGrade(Stu s1,Stu s2){
    if(s1.grade==s2.grade){
        return s1.ID<s2.ID;
    }
    else{
        return s1.grade<s2.grade;
    }

}
int main()
{
    scanf("%d %d",&n,&c);
    for(int i=0;i<n;i++){
        scanf("%d %s %d",&stu[i].ID,stu[i].name,&stu[i].grade);
    }
    if(c==1)
        sort(stu,stu+n,cmpID);
    else if(c==2)
        sort(stu,stu+n,cmpName);
    else
        sort(stu,stu+n,cmpGrade);
    for(int i=0;i<n;i++){
        printf("%06d %s %d
",stu[i].ID,stu[i].name,stu[i].grade);
    }
    return 0;
}