HDOJ 1031 模拟

题目连接：http://acm.hdu.edu.cn/showproblem.php?pid=1031
这题目说实话理解了题目意思真没啥好说的- -。

#include<bits/stdc++.h>
#define PI 3.1415926 
#define INF 1e18 
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;
const ll MAX = 1e3+50;
struct node{
    float sum;
    int index;
}f[MAX];
bool cmp1(node n1,node n2){
    if(n1.sum == n2.sum)
        return n1.index < n2.index;
    else 
        return n1.sum > n2.sum;
}
bool cmp2(node n1,node n2){
    return n1.index > n2.index;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n,m,k;
    while(cin>>n>>m>>k){
        for(int i = 1 ; i <= m ; i++){
            f[i].sum = 0;
            f[i].index = i;
        }
        for(int i = 1 ; i <= n ; i++){
            for(int j = 1 ; j <= m ; j++){
                float ch ;
                cin >> ch;
                f[j].sum += ch;
            }
        }
        sort(f+1,f+m+1,cmp1);
        sort(f+1,f+k+1,cmp2);
        for(int i = 1 ; i <= k-1 ; i++)
            cout<<f[i].index<<" ";
        cout<<f[k].index<<endl;
    }
    return 0;
}