HDOJ 1031

HDOJ     1031  

题目还是蛮清楚的， Exe.Time 78Ms, Exe.    Memory 236K.

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.

 

#include "stdio.h"


int main(int argc, char* argv[])
{
	int N,M,K,i,j,ou[1000],temp1;
    float temp;
	//memset()
	while(scanf("%d %d %d",&N,&M,&K)!=EOF)
	{
		float ob[1000]={0};
		for(i=1;i<=M;i++)                      //用来输出序号
		{
			ou[i]=i;
		}                                  
		for(i=1;i<=N;i++)
			for(j=1;j<=M;j++)
			{
				scanf("%f",&temp);
				ob[j]+=temp;
			}
		for(i=1;i<=M-1;i++)                    //排序
		{
			for(j=i;j<=M;j++)
			{
				if(ob[j]>ob[i])
				{
					temp=ob[i];
					ob[i]=ob[j];
					ob[j]=temp;
					temp1=ou[i];
					ou[i]=ou[j];
					ou[j]=temp1;
				}
				if(ob[j]==ob[i] && ou[i]>ou[j])
				{
					temp1=ou[i];
					ou[i]=ou[j];
					ou[j]=temp1;
				}
			}
		}
		for(i=1;i<=K-1;i++)
		{
			for(j=i;j<=K;j++)
			{
				if(ou[j]>ou[i])
				{
					temp1=ou[i];
					ou[i]=ou[j];
					ou[j]=temp1;
				}
			}
		}		
		for(i=1;i<=K-1;i++)
		{
			printf("%d ",ou[i]);
		}
		printf("%d",ou[K]);
		printf("\n");
	}
	return 0;
}

 

 

个人感觉几个需要小注意的地方：
1、处理的过程多了一些，需要谨慎。
2、循环过程中的准确清0很重要，避免很难发现的错误。
3、输出格式要留意一下。

程序可以改进的地反：
自己习惯用C来AC了，如果用C++模板类，sort函数感觉会好一些，用struct结构思路更规范一些。