Cod sursă (job #411811)

#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("lanterna.in");
ofstream fout("lanterna.out");
int main()
{
	int v[100005],i,s1,s2,n;
	long long to;
	to=0;
	fin>>n;
	for(i=1;i<=n;i++)
		fin>>v[i];
	sort(v+1,v+n+1);
	while(n>3)
	{
		s1=2*v[2]+v[1]+v[n];
		s2=2*v[1]+v[n]+v[n-1];
		if(s1<s2)
			to=to+s1;
		else
			to=to+s2;
		n=n-2;
	}
	//fout<<to;
	if(n==2)
		to=to+v[2];
	else
		to=to+v[1]+v[2]+v[3];
	fout<<to;
	return 0;
}