EXCEL排序
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20311 Accepted Submission(s): 7428
行,每行包含一條學生紀錄。每條學生紀錄由學號(6位數字,同組測試中沒有重複的學號)、姓名(不超過8位且不包含空格的字符串)、成績(閉區間[0, 100]內的整數)組成,每個項目間用1個空格隔開。當讀到 N=0 時,全部輸入結束,相應的結果不要輸出。
注意題上帶顏色的字,搞明白這個,再用sort排序就OK了,0.0
代碼:#include<stdio.h>
#include <cstring>
#include <algorithm>
using namespace std;
struct people
{
int num;
char name[50];
int score;
}p[100002];
bool cmp3(people a,people b)
{
if(a.score==b.score)
return a.num<b.num;
else
return a.score<b.score;
}
bool cmp2(people a,people b)
{
if(strcmp(a.name,b.name)==0)
return a.num<b.num;
else
{
int t=strcmp(a.name,b.name);
if(t==-1)
return true;
else
return false;
}
}
bool cmp1(people a,people b)
{
return a.num<b.num;
}
int main()
{
int n,c,j=1;
while(scanf("%d",&n)&&n!=0)
{
scanf("%d",&c);
for(int i=0;i<n;i++)
{
scanf("%d",&p[i].num);
scanf("%s",p[i].name);
scanf("%d",&p[i].score);
}
if(c==1)
sort(p,p+n,cmp1);
else if(c==2)
sort(p,p+n,cmp2);
else if(c==3)
sort(p,p+n,cmp3);
printf("Case %d:\n",j++);
for(int i=0;i<n;i++)
{
printf("%06d %s %d\n",p[i].num,p[i].name,p[i].score);
}
}
return 0;
}