POJ1581-A Contesting Decision
http://poj.org/problem?id=1581
嗯。。。知道罚金怎么算了吧- -#
#include<stdio.h> #include<string.h> int main(void) { int i,j,n,ans,tem,times[300],solve[300],a[10]; char name[300][100]; while(scanf("%d",&n)!=EOF) { memset(solve,0,sizeof(solve)); for(i=0;i<n;i++) { tem=0; scanf("%s",name[i]); for(j=0;j<8;j++) scanf("%d",&a[j]); for(j=0;j<8;j+=2) { if(a[j+1]!=0) { tem+=(a[j]-1)*20+a[j+1]; solve[i]++; } } times[i]=tem; } ans=0; for(i=0;i<n;i++) { if(solve[i]>solve[ans]) ans=i; if(solve[i]==solve[ans]&×[i]<times[ans]) ans=i; } printf("%s %d %d\n",name[ans],solve[ans],times[ans]); } return 0; }