结构体

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
#define maxn 100000+10
struct student
{
 char num[10];
 char name[10];
 int score;
}stu[maxn];
bool cmp(student a,student b)
{
 return strcmp(a.num,b.num)<0;
}
bool cmp1(student a,student b)
{
 if(strcmp(a.name,b.name)==0)
 return strcmp(a.num,b.num)<0;
 else
  return strcmp(a.name,b.name)<0;
}
bool cmp3(student a,student b)
{
 if(a.score==b.score)
  return strcmp(a.num,b.num)<0;
 else return a.score<b.score;
}
int main()
{
 int n,c,i,j,d=0;
 while(scanf("%d",&n)!=EOF&&n)
 {
  scanf("%d",&c);
  for(i=0;i<n;i++)
  {
   scanf("%s%s%d",stu[i].num,stu[i].name,&stu[i].score);
  }
  printf("Case %d:\n",++d);
  if(c==1) sort(stu,stu+n,cmp);
  if(c==2) sort(stu,stu+n,cmp1);
  if(c==3) sort(stu,stu+n,cmp3);
  for(i=0;i<n;i++)
   printf("%s %s %d\n",stu[i].num,stu[i].name,stu[i].score);
 }
 return 0;
}