Aitaus

#include <iostream>
#include <algorithm>
#include <set>

using namespace std;
typedef long long ll;
#define INF 100000000

int n;
multiset<long long> s;


int main() {
    cin >> n;
    
    ll minc = 0;
    
    for (int i = 0; i < n; ++i) {
        int cur;
        cin >> cur;
        s.insert(cur);      
    }
    
    while (s.size() > 1) {
        ll a = *(s.begin());
        s.erase(s.begin());
        ll b = *(s.begin());
        s.erase(s.begin());
        minc += a+b;
        s.insert(a+b);
    }
    cout << minc << "\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