Input
测试输入包含若干测试用例。每个测试用例的第1行包含两个整数 N (N<=100000) 和 C,其中 N 是纪录的条数,C 是指定排序的列号。以下有N行,每行包含一条学生纪录。每条学生纪录由学号(6位数字,同组测试中没有重复的学号)、姓名(不超过8位且不包含空格的字符串)、成绩(闭区间[0, 100]内的整数)组成,每个项目间用1个空格隔开。当读到 N=0 时,全部输入结束,相应的结果不要输出。
Output
对每个测试用例,首先输出1行“Case i:”,其中 i 是测试用例的编号(从1开始)。随后在 N 行中输出按要求排序后的结果,即:当 C=1 时,按学号递增排序;当 C=2时,按姓名的非递减字典序排序;当 C=3 时,按成绩的非递减排序。当若干学生具有相同姓名或者相同成绩时,则按他们的学号递增排序。
Sample Input
Sample Output
HINT
#include<bits/stdc++.h>
using namespace std;
struct chengjibiao
{
char xuehao[10];
char xingming[20];
int chengji;
}shumu[100004];
int cmp(const void * a, const void * b)
{
chengjibiao *x = (chengjibiao *)a;
chengjibiao *y = (chengjibiao *)b;
return strcmp(x->xuehao,y->xuehao);
}
int cmp1(const void *a,const void *b)
{
chengjibiao *x = (chengjibiao *)a;
chengjibiao *y = (chengjibiao *)b;
if (strcmp(x->xingming,y->xingming)==0)
return strcmp(x->xuehao,y->xuehao);
return strcmp(x->xingming,y->xingming);
}
int cmp2(const void *a,const void *b)
{
chengjibiao *x = (chengjibiao *)a;
chengjibiao *y = (chengjibiao *)b;
if (x->chengji == y->chengji)
return strcmp(x->xuehao, y->xuehao);
return x->chengji - y->chengji;
}
int main()
{
int a, b,count=1;
while (cin >> a >> b&&a)
{
for (int i = 0; i < a; i++)
cin >> shumu[i].xuehao >> shumu[i].xingming >> shumu[i].chengji;
if (b == 1)
qsort(shumu, a, sizeof(chengjibiao), cmp);
else if (b == 2)
qsort(shumu, a, sizeof(chengjibiao), cmp1);
else
qsort(shumu, a, sizeof(chengjibiao), cmp2);
cout << "Case " << count << ":" << endl;
for (int i = 0; i < a; i++)
cout << shumu[i].xuehao << " " << shumu[i].xingming << " " << shumu[i].chengji << endl;
count++;
}
system("pause");
return 0;
}