HDU 1031 Design T-Shirt 模拟 水题

题意：m个物品中找出k个满意度最大的，满意度相等的情况下，取编号最小的。最后倒序输出这些编号。

思路：排序一遍即可。

http://acm.hdu.edu.cn/showproblem.php?pid=1031

/*********************************************
    Problem : HDU 1031
    Author  : NMfloat
    InkTime (c) NM . All Rights Reserved .
********************************************/

#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#define rep(i,a,b)  for(int i = a ; i <= b ; i ++)
#define rrep(i,a,b) for(int i = b ; i >= a ; i --)
#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)
#define cls(a,x)   memset(a,x,sizeof(a))
#define eps 1e-8

using namespace std;

const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5+5;
const int MAXE = 2e5+5;

typedef long long LL;
typedef unsigned long long ULL;

int T,n,m,k;

struct Node {
    double value ; 
    int idx ;
    Node(){}
    Node(double _value,int _idx) {value = _value ; idx = _idx;}
}t[1005];

int ans[1005];

bool cmp(Node a1,Node a2) {
    if(fabs(a1.value-a2.value)<eps) {
        return a1.idx < a2.idx;
    }
    return a1.value > a2.value;
}

void input() {
    rep(i,1,m) t[i] = Node(0,i);
    double tmp;
    rep(i,1,n) rep(j,1,m) {
        scanf("%lf",&tmp);
        t[j].value += tmp;
    }
}

void solve() {
    sort(t+1,t+m+1,cmp);
    rep(i,1,k) {
        ans[i] = t[i].idx;
    }
    sort(ans+1,ans+k+1);
    rrep(i,1,k) {
        printf("%d",ans[i]);
        if(i == 1) puts("");
        else printf(" ");
    }
}

int main(void) {
    //freopen("a.in","r",stdin);
    //scanf("%d",&T); while(T--) {
    while(~scanf("%d %d %d",&n,&m,&k)) {
    //while(scanf("%d",&n),n) {
        input();
        solve();
    }
    return 0;
}