10954 - Add All

水题一发，具体证明见紫书上huffman的讲解

#include<bits/stdc++.h>using namespace std;int main(){    int n,x;    while(~scanf("%d",&n)&&n){        priority_queue<int, vector<int>, greater<int> > q;        for(int i=0;i<n;i++) {            scanf("%d",&x);            q.push(x);        }        int ans = 0;        for(int i=0;i<n-1;i++) {            int a = q.top(); q.pop();            int b = q.top(); q.pop();            ans += a+b;            q.push(a+b);        }        printf("%d\n",ans);    }    return 0;}