1028. List Sorting (25)

#include<iostream>
#include<string>
#include<vector> 
#include<algorithm>
using namespace std;
struct rec{
	int id;
	string name;
	int score;
};
int n, c;
vector<rec> recs;
bool comp1(rec a, rec b){
	if(a.id < b.id) return true;
	else return false;
}
bool comp2(rec a, rec b){
	if(a.name != b.name) return a.name < b.name;
	else{
		return a.id < b.id;
	}
}
bool comp3(rec a, rec b){
	if(a.score != b.score) return a.score < b.score;
	else{
		return a.id < b.id;
	}
}
int main(){
	cin>>n>>c;
	for(int i = 0; i < n; i++){
		rec a;
		scanf("%d",&a.id);
		cin>>a.name;
		scanf("%d",&a.score);
		recs.push_back(a);
	}
	switch(c){
		case 1: sort(recs.begin(),recs.end(),comp1);break;
		case 2: sort(recs.begin(),recs.end(),comp2);break;
		case 3: sort(recs.begin(),recs.end(),comp3);break;
	}
	for(int i = 0; i < n; i++){
		printf("%06d %s %d\n",recs[i].id,recs[i].name.c_str(),recs[i].score); 
	}
	return 0;
}