暑假集训 第三节 哈夫曼

int n, a[100];
int WPL()
{
    priority_queue<int, vector<int>, greater<int> > q;
    for (int i = 0; i < n; i++)
        q.push(a[i]);
    int wpl = 0;
    while (q.size()>1)
    {
        int d1 = q.top();
        q.pop();
        int d2 = q.top();
        q.pop();
        wpl += d1 + d2;
        q.push(d1+d2);
    }
    return wpl;
}