patA1028 List Sorting

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
struct student{
int id;
char name[10];
int score;
}stu[100002];
bool cmp1(student a,student b){
return a.id<b.id;
} bool cmp2(student a,student b){ if(strcmp(a.name,b.name)!=0) return strcmp(a.name,b.name)<0; 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 argc, char** argv) { int n,c; scanf("%d%d",&n,&c);











for(int i=0;i<n;i++){
scanf("%d %s %d",&stu[i].id,stu[i].name,&stu[i].score);
}
if(c==1){
sort(stu,stu+n,cmp1);
for(int i=0;i<n;i++) printf("%06d %s %d\n",stu[i].id,stu[i].name,stu[i].score);
}
else if(c==2){
sort(stu,stu+n,cmp2);
for(int i=0;i<n;i++) printf("%06d %s %d\n",stu[i].id,stu[i].name,stu[i].score);
}else if(c==3){
sort(stu,stu+n,cmp3);
for(int i=0;i<n;i++) printf("%06d %s %d\n",stu[i].id,stu[i].name,stu[i].score);
}
return 0;

}