蓝桥杯--huffman树

http://47.104.209.207/problem/old1070

问Huffman树的费用，直接用堆解决。

#include<iostream>
#include<queue>

using namespace std;

int main(){
    int n;
    cin>>n;
    priority_queue<int,vector<int>,greater<int>> q;
    for(int i=0;i<n;i++){
        int t;
        cin>>t;
        q.push(t);
    }
    int res=0;
    while(q.size()>=2){
        int a=q.top();
        q.pop();
        int b=q.top();
        q.pop();
        res+=a+b;
        q.push(a+b);
    }
    cout<<res;
    return 0;
}