hdu 1031 Design TShirt

http://acm.hdu.edu.cn/showproblem.php?pid=1031

水题不解释，之前看错题意。

#include <stdio.h>
#include <stdlib.h>
#include<string.h>
struct Node
{
      int number;
      double satisfy;
}node[1010];
int cmp1(const void*x,const void*y)
{
     struct Node *aa=(struct Node*)x;
     struct Node *bb=(struct Node*)y;
     if(aa->satisfy==bb->satisfy)
     return aa->number-bb->number;
     return bb->satisfy-aa->satisfy;
}
int cmp2(const void*x,const void*y)
{
      return *(int*)y-*(int*)x;
}
int main()
{
    int n,m,k;
    int i,j;
    double xx;
    while(~scanf("%d%d%d",&n,&m,&k))
    {

          memset(node,0,sizeof(node));
          for(i=0;i<n;i++)
          {
                for(j=0;j<m;j++)
                {
                      scanf("%lf",&xx);
                      node[j].satisfy+=xx;
                      node[j].number=j+1;
                }
          }
          qsort(node,m,sizeof(node[0]),cmp1);
          qsort(node,k,sizeof(node[0]),cmp2);
          for(i=0;i<k-1;i++)
          printf("%d ",node[i].number);
          printf("%d\n",node[k-1].number);

    }
}