noi.openjudge 2469:电池的寿命 贪心

设最大寿命的为 x
其他 n-1 电池的寿命和为 sum2
如果 sum2 < x 那么无法均分成两半来使用

反之， 答案等于 总sum/2；即全部用光

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
using namespace std;

int main()
{
    int n;
    while(cin >> n)
    {
        int sum = 0, maxn = 0, x;
        for(int i = 1; i <= n; ++ i)
        {
            scanf("%d", &x);
            maxn = max(maxn, x);
            sum += x;
        }
        int sum2 = sum-maxn;
        if(sum2 <= maxn)
            printf("%.1f\n", (double)sum2);
        else printf("%.1f\n", (double)((double)sum/2.0));
    }
    return 0;
}