Cod sursă (job #65285)

#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("lanterna.in");
ofstream g("lanterna.out");
int n,x,y,V[100009];
long long s;
int main()
{
    f >> n;
    for(int i=1; i<=n; i++) f >> V[i];
    sort(V+1, V+1+n);
    while(n > 3)
    {
        x = V[1] + V[2]*2 + V[n];
        y = V[1]*2 + V[n-1] + V[n];
        s += min(x, y);
        n = n - 2;
    }

    if(n == 3)
    {
        s += V[1] + V[2] + V[3];
    }
    else
    {
        s += V[2];
    }
    g << s << '\n';
    g.close();
    return 0;
}