poj3253——Fence Repair

哈夫曼树应用。

思路：优先队列模拟。注意数据范围！

#include<iostream> #include<cstdio> #include<cstring> #include<queue> using namespace std; int main() { priority_queue<long long ,vector<long long >,greater<long long > >tree; int n; long long a,b,sumab; cin>>n; while(n--) { scanf("%lld",&a); tree.push (a); } long long min=0; while(!tree.empty ()) { a=tree.top (); tree.pop (); if(tree.empty ()) break; b=tree.top (); tree.pop (); sumab=a+b; min+=sumab; tree.push (sumab); } cout<<min<<endl; return 0; }