148. 合并果子

哈夫曼树的模板题

#include 
#include 
#include 
using namespace std;
int main(){
    priority_queue<int, vector<int>, greater<int>> pq;
    int n, x;
    cin>>n;
    for(int i = 0; i < n; i++){
        cin>>x;
        pq.push(x);
    }
    long long ans = 0;
    
    while(pq.size() > 1){
        int a = pq.top();
        pq.pop();
        int b = pq.top();
        pq.pop();
        ans += a+b;
        pq.push(a+b);
    }
    cout<<ans<<endl;
    return 0;
}