Aitaus

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main() {

	int n;
	ll p = 0;
	cin >> n;
	multiset<ll> m;
	for (int i = 0; i<n; i++) {
		int a;
		cin >> a;
		m.insert(a);
	}
	while (m.size() > 1) {
		auto it = m.begin();
		ll c = *it;
		m.erase(m.find(*it));
		it = m.begin();
		ll d = *it;
		c+=d;
		p += c;
		m.erase(m.find(*it));
		m.insert(c);
	}
	cout << p << "\n";
	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED