题目：http://codeup.cn/problem.php?id=21142&csrf=bvHcDf5kc87m5weAdrD1yXRXLa23xYvG

可以不用求出树形结构的哈夫曼带权路径，利用了priority_queue，代码比较简介

代码

  1. #include<algorithm>
  2. #include<queue>
  3. #include<iostream>
  4. #include<cstdio>
  5. using namespace std;
  6. typedef long long LL;
  8. priority_queue<LL, vector<LL>, greater<LL> >q;
  10. int main(){
  11.     int n;
  12.     LL temp, ans = 0; 
  13.     scanf("%d", &n);
  14.     for(int i = 0; i < n; i++){
  15.         scanf("%lld", &temp);
  16.         q.push(temp);
  17.     }
  18.     while(q.size() > 1){
  19.         LL a = q.top();
  20.         q.pop();
  21.         LL b = q.top();
  22.         q.pop();
  23.         q.push(a + b);
  24.         ans += a + b;
  25.     }
  26.     printf("%lld", ans);
  27.     return 0;
  28. }