hdu 1031 Design T-Shirt

两次排序搞定！

第一次把总数排下序。第二次把前K个按照index排下序。。。

 

#include <iostream>#include<algorithm>using namespace std;struct Element{int num;float sum;}ele[1010];int n,m,k;int cmp1(Element a,Element b){return a.sum>b.sum;}int cmp2(Element a,Element b){return a.num>b.num;}int main(){//freopen("in.txt","r",stdin);while(scanf("%d %d %d",&n,&m,&k)==3){for(int i=1;i<=m;i++){ele[i].sum=0;ele[i].num=i;}for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){float a;scanf("%f",&a);ele[j].sum+=a;}sort(ele+1,ele+m+1,cmp1);sort(ele+1,ele+k+1,cmp2);printf("%d",ele[1].num);for(int i=2;i<=k;i++)printf(" %d",ele[i].num);printf("\n");}return 0;}