1028. List Sorting

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

struct pat{
	int id;
	char name[10];
	int grade;
}p[100010];

bool cmp1(pat a,pat b){
	if(a.id!=b.id) return a.id<b.id;
}
bool cmp2(pat a,pat b){
	int s =strcmp(a.name,b.name);
	if(s!=0) return s<0;
	else return a.id<b.id;
}
bool cmp3(pat a,pat b){
	if(a.grade!=b.grade) return a.grade<b.grade;
	else return a.id<b.id;
}
int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++){
		scanf("%d %s %d",&p[i].id,p[i].name,&p[i].grade);
		
	}
	if(m==1) sort(p,p+n,cmp1);
	else if(m==2) sort(p,p+n,cmp2);
	else sort(p,p+n,cmp3);
	
	for(int i=0;i<n;i++){
		printf("%06d %s %d\n",p[i].id,p[i].name,p[i].grade);
	}
}