1028. List Sorting (25)

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

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

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

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


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


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

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

}
return 0;
}