hdoj-1031-Design T-Shirt

题目链接

/*
两次排序，搞定
*/
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
struct node {
    int key;
    double sum;
    bool operator <(const node& para)  const {
        if (sum > para.sum )return true;
        else if (sum == para.sum) {
            if (key > para.key) return true;
            else return false;
        }else return false;
    }
}arr[];
bool cmp(node a, node b) {
    return a.key > b.key;
}
int main() {
    int n,m ,k;
    while (cin>>n>>m>>k) {
        memset(arr, , sizeof(arr));
        for (int i=; i<n; i++) {
            for (int j=; j<m; j++) {
                double tmp;
                scanf("%lf", &tmp);
                arr[j].sum += tmp;
                arr[j].key = j;
            }
        }
        sort(arr, arr+m);
        sort(arr, arr+k, cmp);
        printf("%d", arr[].key + );
        for (int i=; i<k; i++)  {
            printf(" %d",arr[i].key + );
        }
        printf("\n");
    }
    return ;
}