POJ_3253_Fence Repair(哈夫曼树)

 

# include <stdio.h>
# include <algotithm>
int main()
{
    int n,i,j,temp;
    __int64 a[20000],sum=0,count=0,b;
    scanf("%d",&n);
    for(i=0;i<n;i++)
        scanf("%I64d",&a[i]);
    std::sort(a,a+n);
    for(i=0;i<n-1;i++)
    {
        b=a[i]+a[i+1];
        j=i+1;
        while(b>a[j]&&j<n)
        {
            a[j-1]=a[j];
            j++;
        }
        a[j-1]=b;
        sum=sum+b;
    }
    printf("%I64d",sum);
    return 0;
}