Aitaus

#include <bits/stdc++.h>

#define ll long long 
#define pii pair<int, int>
#define pllk pair<long long, long long>
#define M 1000000007
#define INF 0x5ADFACE5
#define LINF 0x51DEEFFEC7C0DECALL
#define N (1<<18)

using namespace std;

ll dp[1111][1111];
ll s[111111];

ll brute2 (int n, vector<ll>& v, int l, int r) {
	if (l == r) return 0;
	if (dp[l][r]) return dp[l][r];
	ll b = LINF;
	for (int k = l; k < r; k++) {
		ll a = brute2(n, v, l, k) + brute2(n, v, k + 1, r);
		if (a < b) b = a;
	}
	dp[l][r] = b + s[r] - s[l - 1];
	return dp[l][r];
}

ll brute3 (int n, vector<ll>& v, int l, int r) {
	if (l == r) return 0;
	if (dp[l][r]) return dp[l][r];
	int x = l;
	for (int k = (r - l); k >= 1; k /= 2) {
		while (x + k < r && 2 * s[x + k] <= s[r]) x += k;
	}
	ll b = brute3(n, v, l, x) + brute3(n, v, x + 1, r);
	if (x + 1 != r) b = min(brute3(n, v, l, x + 1) + brute3(n, v, x + 2, r), b);
	dp[l][r] = b + s[r] - s[l - 1];
	return dp[l][r];
}

int main () {
	int n;
	cin>>n;
	vector<ll> v(n + 1);
	for (int i = 1; i <= n; i++) {
		cin>>v[i];
	}
	sort(v.begin() + 1, v.end());
	for (int i = 1; i <= n; i++) s[i] = v[i] + s[i - 1];
	//cout<<brute2(n, v, 1, n)<<endl;
	cout<<brute3(n, v, 1, n)<<endl;
}

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

Test 7

Group: 2

Verdict: WRONG ANSWER

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: RUNTIME ERROR

Test 12

Group: 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: RUNTIME ERROR

Test 14

Group: 3

Verdict: RUNTIME ERROR

Test 15

Group: 3

Verdict: RUNTIME ERROR