POJ 3253

最新推荐文章于 2019-04-19 21:35:47 发布

Vectorxj

最新推荐文章于 2019-04-19 21:35:47 发布

阅读量476

点赞数

CC 4.0 BY-SA版权

分类专栏：树文章标签： poj

本文链接：https://blog.youkuaiyun.com/Vectorxj/article/details/50993915

树专栏收录该内容

22 篇文章

订阅专栏

Huffman树详见http://blog.youkuaiyun.com/shuangde800/article/details/7341289

然而我用小根堆过的
跟合并果子一样


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

long long i,j,k,m,n,a[20001],ans;

inline bool cmp(long long a,long long b){return a>b;}

inline long long readint()
{
    char c=getchar();long long x=0;
    while(c<'0'||c>'9')c=getchar();
    while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();
    return x;
}

int main()
{
    n=readint();
    for(i=1;i<=n;i++)a[i]=readint();
    make_heap(a+1,a+n+1,cmp);
    while(n>1)
    {
        pop_heap(a+1,a+n+1,cmp);
        pop_heap(a+1,a+n,cmp);
        a[n-1]+=a[n];
        ans+=a[n-1];n--;
        push_heap(a+1,a+n+1,cmp);
    }
    cout<<ans<<endl;
    return 0;
}