PAT甲级1028 List Sorting

AC代码

#include<bits/stdc++.h>
using namespace std;
struct Student{
    int id;
    char name[10];
    int score;
};
bool cmp1(Student a,Student b)
{
    return a.id<b.id;
}
bool cmp2(Student a,Student b)
{
    if(strcmp(a.name,b.name)!=0)
    {
    	int len=min(strlen(a.name),strlen(b.name));
    	for(int i=0;i<len;i++)
    	{
    		if(a.name[i]!=b.name[i]) return a.name[i]<b.name[i];
    	}
    	return strlen(a.name)<strlen(b.name);
    }
    else return a.id<b.id;
}
bool cmp3(Student a,Student b)
{
    if(a.score!=b.score) return a.score<b.score;
    else return a.id<b.id;
}
int main()
{
    int n,c;
    scanf("%d%d",&n,&c);
    Student student[n];
    for(int i=0;i<n;i++)
    {
        scanf("%d%s%d",&student[i].id,student[i].name,&student[i].score);
    }
    if(c==1)
    {
        sort(student,student+n,cmp1);
    }else if(c==2)
    {
        sort(student,student+n,cmp2);
    }else{
        sort(student,student+n,cmp3);
    }
    for(int i=0;i<n;i++)
    {
        printf("%06d %s %d\n",student[i].id,student[i].name,student[i].score);
    }
    return 0;
}