1028. List Sorting (25)

 #include <vector>
 #include <stdio.h>
 #include <string.h>
 #include <algorithm>
 using namespace std;

 struct MyStruct
 {
 char ID[];
 char name[];
 int grade;
 };

 int cmp1(MyStruct a,MyStruct b)
 {
 return (strcmp(a.ID,b.ID)<);
 }

 int cmp2(MyStruct a,MyStruct b)
 {
 if(strcmp(a.name,b.name)==) return (strcmp(a.ID,b.ID)<);
 else return strcmp(a.name,b.name)<;
 }

 int cmp3(MyStruct a,MyStruct b)
 {
 if(a.grade==b.grade) return (strcmp(a.ID,b.ID)<);
 else return a.grade<b.grade;
 }

 int main()
 {
 int n,c,i;
 while(scanf("%d %d",&n,&c)!=EOF)
 {
 vector <MyStruct> vv;
 for(i=;i<n;i++)
 {
 MyStruct tem;
 getchar();
 scanf("%s %s %d",tem.ID,tem.name,&tem.grade);
 vv.push_back(tem);
 }
 if(c==)
 sort(vv.begin(),vv.end(),cmp1);
 if(c==)
 sort(vv.begin(),vv.end(),cmp2);
 if(c==)
 sort(vv.begin(),vv.end(),cmp3);

 for(i=;i<n;i++)
 printf("%s %s %d\n",vv[i].ID,vv[i].name,vv[i].grade);

 }
 return ;
 }