1070 结绳

 有种哈夫曼二叉树的思想。

#include<iostream>
#include<algorithm>
using namespace std;

int a[10010] ={0};
int main(){
    int n;
    cin>>n;
    for(int i = 0 ;i < n;++i)
        scanf("%d",&a[i]);
    sort(a,a+n);
    double sum = a[0];
    for(int i = 1; i < n;++i)
        sum = (sum+a[i])/2.0;
    printf("%d",(int)sum);
    return 0;
}