例题8-11(uva-10954)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 5005;
int input,n;

int main()
{
    
    
	while (cin >> n && n) {
    
    
		priority_queue<int, vector<int>, greater<int>> q;
		for (int i = 0; i < n; i++) {
    
    
			cin >> input;
			q.push(input);
		}
		int ans = 0;
		while (--n) {
    
    
			int a = q.top(); q.pop();
			int b = q.top(); q.pop();
			ans += a + b;
			q.push(a + b);
		}
		cout << ans << endl;
	}
	return 0;
}