简单的结构体二级排序

#include<iostream>
using namespace std;

typedef struct
{
char name[20];
int subnum;
char sub[100][20];
int mark[100];
int totalmark;
}Student;
Student student[70];


int cmp(const void *a,const void *b)
{
Student *c=(Student *)a;
Student *d=(Student *)b;
if(c->totalmark!=d->totalmark)
return d->totalmark-c->totalmark;
else
return strcmp(c->name,d->name);
}

int main()
{
int T,N,i,j,k=1;
cin>>T;
while(T--)
{
cin>>N;
for(i=0;i<N;i++)
{
student[i].totalmark=0;
cin>>student[i].name>>student[i].subnum;
for(j=0;j<student[i].subnum;j++)
{
cin>>student[i].sub[j]>>student[i].mark[j];
student[i].totalmark+=student[i].mark[j];
}
}
qsort(student,N,sizeof(student[0]),cmp);
cout<<"Case #"<<k++<<":"<<endl;
for(i=0;i<N;i++)
{
cout<<student[i].name<<" "<<student[i].subnum;
for(j=0;j<student[i].subnum;j++)
cout<<" "<<student[i].sub[j]<<" "<<student[i].mark[j];
cout<<" "<<student[i].totalmark<<endl;
}
}
return 0;
}