Cod sursă (job #65279)

#include <fstream>
#include<algorithm>
using namespace std;
ifstream in("lanterna.in");
ofstream out("lanterna.out");
int n,x,y,i,v[100001];
int main()
{   long long s=0;
    in>>n;
    for(i=1; i<=n; i++) f>>v[i];
    sort(v+1,v+1+n);
    while(n>3)
    {   x=v[1]+2*v[2]+v[n];
        y=v[n]+2*v[1]+v[n-1];
        if(x<y) s=s+x; else s=s+y;
        n=n-2;
    }
    if(n==3) s=v[1]+v[2]+v[3]+s; else s=v[2]+s;
    out<<s<<'\n'; out.close(); return 0;
}