| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
1581数据都对了,总是wr。#include<stdio.h>
#include<string.h>
main(){
char name[10][20],tena[20];
int sum[10],num[10],i,j,n,aa[8],temp1,temp2,k;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",name[i]);
for(j=0;j<8;j++)
scanf("%d",&aa[j]);
sum[i]=0;
num[i]=0;
for(j=1;j<8;j+=2)
if(aa[j]!=0){
sum[i]++;
num[i]+=(aa[j-1]-1)*20+aa[j];
}
}
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(sum[i]<sum[j])
{
temp2=num[i];
num[i]=num[j];
num[j]=temp2;
temp1=sum[i];
sum[i]=sum[j];
sum[j]=temp1;
strcpy(tena,name[i]);
strcpy(name[i],name[j]);
strcpy(name[j],tena);
}
k=0;
for(i=0;i<n-1;i++)
{
if(sum[i]==sum[i+1])
{
if(num[i]>num[i+1])
k=i+1;
else
k=i;
}
else
break;
}
printf("%s %d %d\n",name[k],sum[k],num[k]);
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator