Cod sursă (job #446695)

#include <bits/stdc++.h>
using namespace std;

ifstream in("lanterna.in");
ofstream out("lanterna.out");

const int nmax = 100001;
int n , v[nmax];

int main()
{
    int i , s;
    s = 0;

    in >> n;

    for(i = 1 ; i <= n ; i++)
        in >> v[i];

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

    while(n > 3)
    {
        s += min(v[1] + 2 * v[2] + v[n] , v[n] + 2 * v[1] + v[n - 1]);
        n -= 2;
    }

    if(n == 3)
        s += v[1] + v[2] + v[3];
    else
        s += v[2];

    out << s << '\n';
    return 0;
}