Aitaus

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
long n, o, p, k;
vector<long> v;
void leik(vector<long> vv) {
	if (vv.size() == 1) return;
	else if (vv.size() == 2) {
		k += vv[0]+vv[1];
		return;
	}
	long s1 = 0, s2 = 0;
	sort(vv.rbegin(), vv.rend());
	vector<long> v2;
	//cout << vv.size() << endl;
	for (auto u: vv) s1 += u;
	k += s1;
	while (max(s2 + vv.back(),  s1 - vv.back()) < max(s2, s1)) {
	//cout << s2 + vv.back() << " " << s1 - vv.back() << endl;
		s2 += vv.back();
		s1 -= vv.back();
		//cout << "moikkamoi" << endl;
		v2.push_back(vv.back());
		vv.pop_back();
	}
	//cout << "kierrokselle lähtee: " << v2.size() << " " << vv.size() << endl;
	if (v2.size() > 1) leik(v2);
	if (vv.size() > 1) leik(vv);
	
}
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> p;
		o += p;
		v.push_back(p);
	}
	sort(v.begin(), v.end());
	leik(v);
	cout << k << '\n';
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER