zoukankan      html  css  js  c++  java
  • HDU-1031(水题)

    Design T-Shirt

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

    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
     
    分析:把每个元素先按从大到小排序相同的则选id小的,再按id从大到小排个序。注意每次重新输入时要清空a数组。
     
     1 #include <cstdio>
     2 #include <cmath>
     3 #include <cstring>
     4 #include <ctime>
     5 #include <iostream>
     6 #include <algorithm>
     7 #include <set>
     8 #include <vector>
     9 #include <sstream>
    10 #include <queue>
    11 #include <typeinfo>
    12 #include <fstream>
    13 #include <map>
    14 #include <stack>
    15 using namespace std;
    16 #define INF 100000
    17 typedef long long ll;
    18 const int maxn=10010;
    19 struct object{
    20     double v;
    21     int id;
    22 }a[maxn];
    23 bool cmp1(object a,object b){
    24     if(a.v!=b.v) return a.v>b.v;
    25     else return a.id<b.id;
    26 }
    27 bool cmp2(object a,object b){
    28     return a.id>b.id;
    29 }
    30 int main()
    31 {
    32     int n,m,k;
    33     while(scanf("%d%d%d",&n,&m,&k)==3){
    34         for(int i=0;i<m;i++) a[i].v=0;
    35         while(n--){
    36             double tmp;
    37             for(int i=0;i<m;i++){
    38                 scanf("%lf",&tmp);
    39                 a[i].v+=tmp;
    40                 a[i].id=i+1;
    41             }
    42         }
    43         sort(a,a+m,cmp1);
    44         sort(a,a+k,cmp2);
    45         for(int i=0;i<k-1;i++)
    46             printf("%d ",a[i].id);
    47         printf("%d
    ",a[k-1].id);
    48     }
    49     return 0;
    50 }
  • 相关阅读:
    仿360拖拽
    js 鼠标拖拽元素移动
    js 随机生成颜色
    vue多视图
    vue 全局组件的注册
    一键分享到QQ空间、QQ好友、新浪微博、微信代码
    vuex如何管理需要即时更新的全局变量
    js检测是哪个浏览器
    for in,Object.keys()与for of的用法与区别
    js三元运算符
  • 原文地址:https://www.cnblogs.com/RRirring/p/4729582.html
Copyright © 2011-2022 走看看