Posted on 2011-09-05 22:20
acpeng 閱讀(470)
評(píng)論(0) 編輯 收藏 引用 所屬分類(lèi):
ACM程序
http://acm.hdu.edu.cn/showproblem.php?pid=1862結(jié)構(gòu)體排序，C++的algorithm，寫(xiě)三個(gè)cmp即可
不過(guò)以這個(gè)數(shù)據(jù)的話，何必
TimeLimit=5000ms~~
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef struct infor
{
char stu_num[7];
char name[9];
int scor;
}stu;
stu data[100002];
int cmp1(stu a,stu b)
{
if(strcmp(a.stu_num,b.stu_num)<0)return 1;
return 0;
}
int cmp2(stu a,stu b)
{
if(strcmp(a.name,b.name)<0)return 1;
else if(strcmp(a.name,b.name)==0)
{
if(strcmp(a.stu_num,b.stu_num)<0)return 1;
}
return 0;
}
int cmp3(stu a,stu b)
{
if(a.scor<b.scor)return 1;
else if(a.scor==b.scor)
{
if(strcmp(a.stu_num,b.stu_num)<0)return 1;
}
return 0;
}
int main()
{
int n,c,i,test=1;
while(scanf("%d%d",&n,&c),n)
{
for(i=0;i<n;i++)
scanf("%s%s%d",data[i].stu_num,data[i].name,&data[i].scor);
if(c==1)sort(data,data+n,cmp1);
else if(c==2)sort(data,data+n,cmp2);
else sort(data,data+n,cmp3);
printf("Case %d:\n",test++);
for(i=0;i<n;i++)
printf("%s %s %d\n",data[i].stu_num,data[i].name,data[i].scor);
}
return 0;
}