#include <stdio.h>
#include <cstring>
#include <algorithm>
using namespace std;
struct student{
int id;
char name[10];
int grade;
}stu[100010];
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.grade!=b.grade){
return a.grade<b.grade;
}else{
return a.id<b.id;
}
}
int main(){
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].grade);
}
switch (c){
case 1:{
sort(stu, stu + n, cmp1);
break;
}
case 2:{
sort(stu, stu + n, cmp2);
break;
}
case 3:{
sort(stu, stu + n, cmp3);
break;
}
}
for(int i=0;i<n;i++){
printf("%06d %s %d",stu[i].id,stu[i].name,stu[i].grade);
if(i!=n-1){
printf("\n");
}
}
return 0;
}
pat a1028
最新推荐文章于 2020-03-06 11:58:14 发布