UVa 10954 - Add All

一道最简单的优先队列的题， 每次把最小的两个相加。

#include <iostream>#include <queue>#include <cstdlib>#include <cstdio>#include <cstring>#include <string>#include <stack>#include <cctype>#include <cmath>#include <ctime>#include <algorithm>using namespace std;int main() {    int x, N;    while(cin >> N&& N) {        int ant = 0;        priority_queue<int, vector<int>, greater<int> > q;        for(int i = 0; i < N; i++) {cin >> x; q.push(x);}        for(int i = 0; i < N - 1; i++) {            int a = q.top(); q.pop();            int b = q.top(); q.pop();            ant += a + b;            q.push(a + b);        }        cout << ant << endl;    }    return 0;}