团体程序设计天梯赛(L2-015 互评成绩 (25 分))

题目：

思路分析：

水题！！！ 

代码实现：

int main() {
    vector<double> result;
    int n, k, m, tmp, sum,max,min;
    cin >> n >> k >> m;
    for (int i = 0; i < n; i++) {
        sum = 0;
        max = 0; min = 100;
        for (int j = 0; j < k; j++) {
            cin >> tmp;
            sum += tmp;
            max = tmp > max ? tmp : max;
            min = tmp < min ? tmp : min;
        }
        sum -= max + min;
        result.push_back(sum/(double)(k-2));
    }
    sort(result.begin(), result.end());
    for (int i = m; i > 0; i--)
        printf("%.3lf%s", *(result.end() - i), i > 1 ? " " : "");
    return 0;
}