Poj 3253 贪心水题

Poj 3253

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

#include <iostream>
#include <queue>
#include <functional>
using namespace std;

priority_queue<int, vector<int>, greater<int> > q;

int main()
{
int n;

while(cin >> n && n)
{
while(n--)
{
int tmp;
cin >> tmp;
q.push(tmp);
}
long long res = 0;
while(q.size() > 1)
{
int min1 = q.top();
q.pop();
int min2 = q.top();
q.pop();

int sum = min1 + min2;
res += sum;
q.push(sum);
}

cout << res << endl;
}

return 0;

}