Cod sursă (job #446047)

#pragma GCC optimize("O3")

#include <bits/stdc++.h>

#define MOD 1000000007

using namespace std;

typedef long long ll;

typedef pair< int , int > PII;



int n, m, a[100100];

ll ans;



int main(){

ifstream cin("lanterna.in");

ofstream cout("lanterna.out");

ios_base::sync_with_stdio(0);

cin.tie(0); cout.tie(0);

cin >> n;

for (int i = 1; i <= n; i++) cin >> a[i];

sort(a + 1, a + n + 1);



for (int i = n; i >= 4; i -= 2){

ll x = a[1] + a[2] + a[2] + a[i];

ll y = a[1] + a[1] + a[i - 1] + a[i];



ans += min(x, y);

}



ans += (a[1] + a[2] + a[3]) - (a[1] + a[3]) * !(n & 1);

cout << ans;



return 0;

}