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=+;
int a[maxn];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=;i<n;i++)
        cin>>a[i];
    sort(a,a+n);
    float lastlen=a[];
    for(int i=;i<n;i++){
        lastlen=(lastlen+a[i])/;
    }
    printf("%d\n",(int)lastlen);
    return ;
}