学步园

#include <stdio.h><br /> int main()<br /> {<br /> long i,j,n,m,k,shu[10001],sw2;<br /> float max[10001],sw1,a;<br /> while(scanf("%ld%ld%ld",&n,&m,&k)!=EOF)<br /> {<br /> for(i=1;i<=n;i++)<br /> for(j=1;j<=m;j++)<br /> {<br /> scanf("%f",&a);<br /> if(i==1) max[j]=a;<br /> else max[j]+=a;<br /> }<br /> for(i=1;i<=m;i++) shu[i]=i;<br /> for(i=1;i<m;i++)<br /> for(j=1;j<=m-i;j++)<br /> {<br /> if(max[j]<max[j+1])<br /> {<br /> sw1=max[j];<br /> max[j]=max[j+1];<br /> max[j+1]=sw1;<br /> sw2=shu[j];<br /> shu[j]=shu[j+1];<br /> shu[j+1]=sw2;<br /> }<br /> }<br /> for(i=1;i<k;i++)<br /> for(j=1;j<=k-i;j++)<br /> {<br /> if(shu[j]<shu[j+1])<br /> {<br /> sw2=shu[j];<br /> shu[j]=shu[j+1];<br /> shu[j+1]=sw2;<br /> }<br /> }<br /> printf("%ld",shu[1]);<br /> for(i=2;i<=k;i++)<br /> printf(" %ld",shu[i]);<br /> printf("/n");<br /> }<br /> return 0;<br /> }<br />