结构体与sort结合

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
struct S{
	string sno;
	string name;
	int grade;
};
int comp_grade(const S&s1,const S&s2){
	return s1.grade<s2.grade;
}
int comp_sno(const S&s1,const S&s2){
	return s1.sno<s2.sno;
}
int comp_name(const S&s1,const S&s2){
	return s1.name<s2.name;
}
int main(){
S s[100002];
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++){
	cin>>s[i].sno>>s[i].name>>s[i].grade;
}	
if(m==1){
 sort(s,s+n,comp_sno);
}
else if(m==2){
sort(s,s+n,comp_name);
}
else{
sort(s,s+n,comp_grade);
}
for(int i=0;i<n;i++){
	cout<<s[i].sno<<" "<<s[i].name<<" "<<s[i].grade<<endl;
}	
return 0;
}