Cod sursă (job #545570)

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