zoukankan      html  css  js  c++  java
  • HDUOJ----(1031)Design T-Shirt

    Design T-Shirt

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

    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
     
    Author
    CHEN, Yue
     
    Source
     
    Recommend
     
    几次排序就可以ac掉...没啥技术...水体
    代码:
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<climits>
     5 #include<cstdlib>
     6 #include<algorithm>
     7 #include<vector>
     8 using namespace std;
     9 
    10 typedef struct Nod
    11 {
    12     int num;
    13     float value;
    14 }nod;
    15   /*二级排序*/
    16 int cmp(nod a,nod b)
    17 {
    18     if(a.value==b.value)
    19     {
    20         return a.num<b.num;  //小到大
    21     }
    22     else
    23         return a.value>b.value;  //降序大到小
    24 }
    25 
    26 int Less(int a,int b)
    27 {
    28     return a>b; //降序大到小
    29 }
    30 int main()
    31 {
    32     int n,m,k,i;
    33     float cnt;
    34     while(scanf("%d %d %d",&n,&m,&k)!=EOF)
    35     {
    36       vector<nod>start(m);
    37       vector<int>ans(k);
    38       /*初始化*/
    39       for(i=0;i<m;i++)
    40       {
    41           scanf("%f",&start[i].value);
    42           start[i].num=i+1;
    43       }
    44       n--;
    45       while(n--)
    46       {
    47        for(i=0;i<m;i++)
    48        {
    49           scanf("%f",&cnt);
    50           start[i].value+=cnt;
    51        }
    52       }
    53       sort(start.begin(),start.end(),cmp);
    54       for(i=0;i<k;i++)
    55       {
    56         ans[i]=start[i].num;
    57       }
    58       sort(ans.begin(),ans.end(),Less);
    59       printf("%d",ans[0]);
    60       for(i=1;i<k;i++)
    61       {
    62       printf(" %d",ans[i]);
    63       }
    64       putchar(10);
    65     }
    66     return 0;
    67 }
    View Code
  • 相关阅读:
    独立博客,从零到千万访问,这三年我都做了什么
    Postman使用详解
    Postman安装与使用
    Python爬虫入门教程:超级简单的Python爬虫教程
    《完全用Linux工作》——转载自清华退学博士
    转:一篇搞定Python正则表达式
    文件上传的单元测试怎么写?
    功能性测试分类
    ajax 学习笔记 timer控件
    ajax 学习笔记 updatepannel控件
  • 原文地址:https://www.cnblogs.com/gongxijun/p/3391406.html
Copyright © 2011-2022 走看看