HDU 1031 Design T-Shirt

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1031

Design T-Shirt

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6257    Accepted Submission(s): 2924

Problem Description

Soon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of suggestions from everyone on the board. It is indeed a mission-impossible to have everybody perfectly satisfied. So he took a poll to collect people's opinions. Here are what he obtained: N people voted for M design elements (such as the ACM-ICPC logo, big names in computer science, well-known graphs, etc.). Everyone assigned each element a number of satisfaction. However, XKA can only put K (<=M) elements into his design. He needs you to pick for him the K elements such that the total number of satisfaction is maximized.

 

Input

The input consists of multiple test cases. For each case, the first line contains three positive integers N, M and K where N is the number of people, M is the number of design elements, and K is the number of elements XKA will put into his design. Then N lines follow, each contains M numbers. The j-th number in the i-th line represents the i-th person's satisfaction on the j-th element.

 

Output

For each test case, print in one line the indices of the K elements you would suggest XKA to take into consideration so that the total number of satisfaction is maximized. If there are more than one solutions, you must output the one with minimal indices. The indices start from 1 and must be printed in non-increasing order. There must be exactly one space between two adjacent indices, and no extra space at the end of the line.

 

Sample Input

  
  

   
   3 6 4
2 2.5 5 1 3 4
5 1 3.5 2 2 2
1 1 1 1 1 10
3 3 2
1 2 3
2 3 1
3 1 2
  
  

 

Sample Output

  
  

   
   6 5 3 1
2 1
  
  

m种设计元素，每种元素有个编号，n个人分别对m种元素有一个满意度，所以我们可以先算出m种元素每种元素的总满意度。

第一次，我们要对这m种元素排序，满意度大的排在前面，如果满意度相同，则编号小的排在前面

然后把前K大的元素截取出来。

第二次，我们要对这K个元素排序，排序规则是编号大的排在前面。

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
struct node
{
    double s;
    int id;
}a[100005];
bool cmp1(node x,node y)
{
    if(x.s!=y.s) return x.s>y.s;
    return x.id<y.id;
}
bool cmp2(node x,node y)
{
    return x.id>y.id;
}
int main()
{
    int n,m,k;
    double x;
    while(~scanf("%d%d%d",&n,&m,&k))
    {
        for(int i=0;i<m;i++) a[i].s=0,a[i].id=i+1;
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
            scanf("%lf",&x),a[j].s+=x;
        sort(a,a+m,cmp1);
        sort(a,a+k,cmp2);
        for(int i=0;i<k-1;i++) printf("%d ",a[i].id);
        printf("%d\n",a[k-1].id);
    }
    return 0;
}