英语题目翻译

1.17题目链接：Design T-Shirt | JXNUOJ

题目：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.

输入：

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.

输出：

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.

翻译：于是他决定为我们在网络论坛的算法板设计一件T恤，但是XKA发现他被来自论坛的所有人的意见搞得焦头烂额，让所有人的要求都完美的被满足确实是不可能完成的任务。所以他发起一个投票去收集人们的选择。这是他获得的：N个人为M个设计元素投票（例如ACM-ICPC这个logo，是计算机科学中一个庞大的名字，被熟知等等）。每个人为投票的元素分配一个数字作为喜爱程度。不过，XKA只能放K（<=M）个元素进入他的设计。他需要你帮助挑出在所有数字中喜爱程度最高的K个元素。
输入：
输入包括几组测试数据，每组数据，第一行包括三个正数N,M,K,其中N是人数，M是设计的元素，K是XKA将要放入他的设计中的元素。然后N跟着成行排列 每行包括M个数字。第j列数字在第i行代表着第i个人对第j个的元素的喜爱程度。
输出：
对每个测试数据，打印一行你将建议XKA考虑的K元素的指数以至于总共的喜爱程度的数字最大化。如果有比一还多的解决方案，你必须输出一个最小的指数。指数从1开始，并且必须以不增长的顺序被打印。必须在两个相邻的指数之间有一个位置，并且在行的最后没有额外的位置。