初涉“优先队列”

#include<bits/stdc++.h>
using namespace std;

struct cmp1{
    bool operator ()(int &a,int &b){
        return a>b;//最小值优先
    }
};

int main()
{
    priority_queue<int,vector<int>,cmp1>que1;//最小值优先

    int n;
    cin >> n;
    int a[n];
    for(int i=0;i < n;i++)
    {
        cin >> a[i];
        que1.push(a[i]);
    }

    int sum = 0;
    while(!que1.empty())
    {
        int x = que1.top();
        que1.pop();
        int y = que1.top();
        que1.pop();
        int hehe = x + y;
        sum += hehe;
        if(!que1.empty())
        {
            que1.push(hehe);
        }
        else break;
    }

    cout << sum << endl;

    return 0;
}