1077

最新推荐文章于 2022-10-13 16:39:39 发布

大道殊同

最新推荐文章于 2022-10-13 16:39:39 发布

阅读量177

点赞数

分类专栏： PAT-B

本文链接：https://blog.csdn.net/zero_1778393206/article/details/79234358

版权

PAT-B 专栏收录该内容

42 篇文章 0 订阅

订阅专栏

PAT_B_1077

#include<stdio.h>
int main()
{
    float ans,G1,G2;
    int n, m,sum;
    float a, Max, Min;
    int i, j;
    scanf("%d%d", &n, &m);
    for (i = 0; i < n; i++)
    {
        Max = 0;
        Min = m + 1;
        ans = G1 = G2 = 0;
        sum = 0;
        for (j = 0; j < n; j++)
        {
            scanf("%f", &a);
            if (a >= 0 && a <= m)
            {
                if (j == 0)
                    G1 = a;
                else
                {
                    G2 += a;
                    sum++;
                    if (a < Min)
                        Min = a;
                    if (a > Max)
                        Max = a;
                }
            }
        }
        G2 = G2 - Min - Max;
        sum = sum - 2;
        ans = (G1 + G2/sum) / 2.0;
        printf("%d\n", (int)(ans+0.5));//ac
        //printf("%.0f\n", ans);//wa  ???
    }
    system("pause");
    return 0;
}