1 #include <iostream> 2 #include <algorithm> 3 #include <cstdio> 4 using namespace std; 5 int fun(int x[], int N) 6 { 7 int t = 0; 8 if (N == 1) t = x[1]; 9 else if (N == 2) t = x[2]; 10 else if (N == 3) t = x[1] + x[2] + x[3]; 11 else { 12 if (x[1] + x[N - 1] < 2 * x[2]) 13 t = x[N] + x[1] + x[N - 1] + x[1]; 14 else t = x[2] + x[1] + x[N] + x[2]; 15 t += fun(x, N - 2); 16 } 17 return t; 18 } 19 int main() 20 { 21 int t, n; 22 int x[10005]; 23 cin >> t; 24 while (t--) 25 { 26 cin >> n; 27 for (int i = 1; i <= n; i++) 28 cin >> x[i]; 29 sort(x + 1, x + n + 1); 30 cout << fun(x, n) << endl; 31 } 32 return 0; 33 }
