PAT甲题题解-1125. Chain the Ropes (25)-贪心水题

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
#include <string>
#include <map>
using namespace std;
const int maxn=10000+5;
int a[maxn];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        cin>>a[i];
    sort(a,a+n);
    float lastlen=a[0];
    for(int i=1;i<n;i++){
        lastlen=(lastlen+a[i])/2;
    }
    printf("%d\n",(int)lastlen);
    return 0;
}