Cod sursă (job #297127)

#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("lanterna.in");
ofstream fout("lanterna.out");
int n,a,b,v[100009];
long long s;
int main()
{fin>>n;
for(int i=1;i<=n;i++){fin>>v[i];}
sort(v+1,v+n+1);
while(n>=4){a=v[1]+v[2]*2+v[n];
           b=v[1]*2+v[n-1]+v[n];
           s=s+min(a,b);
           n=n-2;}
    if(n==3){s=s+v[1]+v[2]+v[3];}
    else{s=s+v[2];}
    fout<<s;
    return 0;
}