hdu1862字典序

主要是字典序排序

 

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