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

简单模拟

#include <bits/stdc++.h>
using namespace std;
int n, k, m;
double res[10010];
bool cmp(double a, double b)
{
    return a > b;
}
int main(void)
{
    cin >> n >> k >> m;
    int score[k];
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < k; j++)
        {
            scanf("%d", &score[j]);
        }
        sort(score, score + k);
        for (int l = 1; l < k - 1; l++)
        {
            res[i] += score[l];
        }
        res[i] = res[i] * 1.0 / (k - 2);
    }
    sort(res, res + n, cmp);
    sort(res,res+m);
    for (int i = 0; i < m; i++)
    {
        if (i != 0)
            printf(" ");
        printf("%.3f", res[i]);
    }
    printf("\n");
    return 0;
}