POJ 3253 修理栅栏 - (贪心 Huffman)

题目链接：http://poj.org/problem?id=3253
Huffman

#include <stdio.h>
#include <algorithm>
#include <functional>
#include <queue>
using namespace std;
//POJ 3253
int main() {
    int n;
    scanf("%d", &n);
    int *length = new int[n];
    for (int i = 0; i < n; ++i)
        scanf("%d", &length[i]);
    long long cost = 0;
    priority_queue<int, vector<int>, greater<int>> pq;
    for (int i = 0; i < n; ++i)
        pq.push(length[i]);
    while (pq.size() > 1) {
        int top1 = pq.top();
        pq.pop();
        int top2 = pq.top();
        pq.pop();
        cost += top1 + top2;
        pq.push(top1 + top2);
    }
    printf("%lld", cost);
    return 0;
}