哈夫曼树 模板+例题

核心代码

while (q.size() > 1) {
        x = q.top();
        q.pop();
        x += q.top();
        q.pop();
        q.push(x);
        sum += x;
    }while (q.size() > 1) {
        x = q.top(