HDU 1031 Design T-Shirt【排序】

最新推荐文章于 2019-12-03 21:10:56 发布

原创最新推荐文章于 2019-12-03 21:10:56 发布 · 248 阅读

0 ·

CC 4.0 BY-SA版权

hdu oj 专栏收录该内容

269 篇文章

订阅专栏

本文介绍了一种解决T恤设计问题的方法，通过收集人们对不同设计元素满意度的数据，并使用编程算法来确定最优的设计组合。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Design T-Shirt

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 7190 Accepted Submission(s): 3398

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

读懂题意之后发现，其实只需要编号然后排序............

2016年的第一道题，接近一个星期没做题了，因为要考试了，所有的时间和精力基本上都在复习功课了，假期再好好学敲代码吧！

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
	int id;
	double val;
}x[1005];
int cmp1(node a,node b)
{
	if(a.val==b.val)
	{
		return a.id<b.id;
	}
	return a.val>b.val;
}
int cmp2(node a,node b)
{
	return a.id>b.id;
}
int main()
{
	int n,m,k;double tp;
	while(~scanf("%d%d%d",&n,&m,&k))
	{
		memset(x,0,sizeof(x));
		for(int i=0;i<n;++i)
		{
			for(int j=0;j<m;++j)
			{
				scanf("%lf",&tp);
				x[j].id=j+1;
				x[j].val+=tp;
			}
		}
		sort(x,x+m,cmp1);
		sort(x,x+k,cmp2);
		printf("%d",x[0].id);
		for(int i=1;i<k;++i)
		{
			printf(" %d",x[i].id);
		}
		printf("\n");
	}
	return 0;
}