大奖赛

#include<stdio.h>
int main()
{
    float b[39][19];
    int m, n;
    int i, j;
    int xs;
    float ave[39];
    float max;
    float min;
    float sum;
    scanf("%d,%d", &m, &n);
    for (i = 0; i < m; i++)
    {
        sum = 0.0;
        max = 0.0;
        min = 10.0;
        for (j = 0; j < n; j++)
        {
            scanf("%f", &b[i][j]);
            if (b[i][j] > max)
                max = b[i][j];
            if (b[i][j] < min)
                min = b[i][j];
            sum = sum + b[i][j];
        }
        sum = sum - max - min;
        ave[i] = sum / (n - 2);
    }   
    for (i = 1; i < m + 1; i++)
    {
        max = ave[0], xs = 0;
        for (j = 0; j < m; j++)
        {
            if (ave[j] >= max)
                max = ave[j], xs = j + 1;
        }
        ave[xs - 1] = 0;
        printf("第%d名:%d号选手,得分%.2f\n", i, xs, max);
    }
    return 0;
}
发布了29 篇原创文章 · 获赞 14 · 访问量 1万+

猜你喜欢

转载自blog.csdn.net/weixin_43343116/article/details/86429010
今日推荐