EXCEL排序（HD1862）

题：http://acm.hdu.edu.cn/showproblem.php?pid=1862

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
struct node
{
    char stid[10];
    char stname[10];
    int stgrade;
};
node Stu[100010];
bool cmp1(node a,node b)
{
    return strcmp(a.stid,b.stid)>0?0:1;
}
bool cmp2(node a,node b)
{
    if(!strcmp(a.stname,b.stname))return strcmp(a.stid,b.stid)>0?0:1;
    return strcmp(a.stname,b.stname)>0?0:1;
}
bool cmp3(node a,node b)
{
    if(a.stgrade == b.stgrade)return strcmp(a.stid,b.stid)>0?0:1;
    return a.stgrade<b.stgrade;
}
int main()
{
    int n,m,cnt=0;
    while(scanf("%d%d",&n,&m) && n && m)
    {
        cnt++;
        for(int i=0; i<n; i++)
            scanf("%s%s%d",Stu[i].stid,Stu[i].stname,&Stu[i].stgrade);
        printf("Case %d:\n",cnt);
        if(m == 1)
            sort(Stu,Stu+n,cmp1);
        else if(m == 2)
            sort(Stu,Stu+n,cmp2);
        else if(m == 3)
            sort(Stu,Stu+n,cmp3);
        for(int i=0; i<n; i++)
            printf("%s %s %d\n",Stu[i].stid,Stu[i].stname,Stu[i].stgrade);
    }
    return 0;
}