题解 | #【模板】哈夫曼编码#

#include <functional>
#include <iostream>
#include <queue>
using namespace std;

int main() {
    int n;
    long long a;
    cin >> n;
    long long num1,num2;
    long long res= 0;
    priority_queue<long long,vector<long long>,greater<>> stack;
    while (cin >> a ) { // 注意 while 处理多个 case
        stack.push(a);
    }

    while( stack.size() >2 ){
        num1 = stack.top();
        stack.pop();
        num2 = stack.top();
        stack.pop();
        res+=(num1+num2);
        stack.push((num1+num2));
    }

    num1 = num1 = stack.top();
    stack.pop();
    num2 = stack.top();
    stack.pop();

    res+=(num1+num2);

    cout << res << endl;
    return 0;
}
// 64 位输出请用 printf("%lld")