[BaekJoon/C++] 13975번 파일 합치기 3

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int t;
	cin >> t;

	while (t--) {
		priority_queue<long long, vector<long long>, greater<long long> >pq;

		int k; cin >> k;
		for (int i = 0; i < k; i++) {
				int x;
				cin >> x;
				pq.push(x);
			}
			long long ans = 0;
			while (pq.size() > 1) {
				long long a = pq.top(); pq.pop();
				long long b = pq.top(); pq.pop();
				ans += (a + b);
				pq.push(a + b);
			}
			cout << ans << "\n";
	}return 0;
}