3 1
000007 James 85
000010 Amy 90
000001 Zoe 60
4 2
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 98
4 3
000007 James 85
000010 Amy 90
000001 Zoe 60
000002 James 90
0 0

Case 1:
000001 Zoe 60
000007 James 85
000010 Amy 90
Case 2:
000010 Amy 90
000002 James 98
000007 James 85
000001 Zoe 60
Case 3:
000001 Zoe 60
000007 James 85
000002 James 90
000010 Amy 90

题解：sort排序水题，注意cmp写法即可。

代码：

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;struct Data{char id[10];//学号int score;//成绩char name[10];//名字
}data[100100];bool cmp1(Data a,Data b){int t = strcmp(a.id , b.id);        //前面的大，返回1；相等返回0；前面的小，返回-1 if (t == -1)return true;elsereturn false;
}bool cmp2(Data a,Data b){if (strcmp(a.name , b.name)){int t = strcmp(a.name , b.name);        //前面的大，返回1；相等返回0；前面的小，返回-1 if (t == -1)return true;elsereturn false;}else{int t = strcmp(a.id , b.id);       //前面的大，返回1；相等返回0；前面的小，返回-1 if (t == -1)return true;elsereturn false;}
}bool cmp3(Data a,Data b){if(a.score!=b.score)return a.score<b.score;else{int t = strcmp(a.id , b.id);     //前面的大，返回1；相等返回0；前面的小，返回-1 if (t == -1)return true;elsereturn false;}}int main(){int n,m;int k=1;while(cin>>n>>m&&n&&m){for(int i=0;i<n;i++)cin>>data[i].id>>data[i].name>>data[i].score;if(m==1){sort(data,data+n,cmp1);cout<<"Case "<<k++<<":"<<endl;for(int i=0;i<n;i++)cout<<data[i].id<<" "<<data[i].name<<" "<<data[i].score<<endl;}else if(m==2){sort(data,data+n,cmp2);cout<<"Case "<<k++<<":"<<endl;for(int i=0;i<n;i++)cout<<data[i].id<<" "<<data[i].name<<" "<<data[i].score<<endl;            }else{sort(data,data+n,cmp3);cout<<"Case "<<k++<<":"<<endl;for(int i=0;i<n;i++)cout<<data[i].id<<" "<<data[i].name<<" "<<data[i].score<<endl;          }}return 0;
}