【题解】POJ3253

#include<iostream>
#include<queue>
using namespace std;
#define MAXN 20005

typedef long long ll;

int n;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);

    //声明小的在前面的优先级队列
    priority_queue<int, vector<int>,greater<int> > q;

    cin>>n;

    int tmp;
    for(int i=0;i<n;++i)
    {
        cin>>tmp;
        q.push(tmp);
    }

    ll ans=0;
    int a1,a2, new_plank;
    while(q.size()>1)
    {
        a1 = q.top();
        q.pop();
        a2 = q.top();
        q.pop();

        new_plank = a1+a2;
        q.push(new_plank);
        ans+=new_plank;
    }

    cout<<ans<<endl;

}