Cod sursă (job #446622)

#include <bits/stdc++.h>
using namespace std; 
ifstream fin("lanterna.in");
ofstream fout("lanterna.out");
int a[100002], i; 
long long aux1, aux2, s=0, n;
int main() {
	fin >> n; 
	for (i=1; i<=n; i++)
	fin >> a[i];
	sort(a+1,a+n+1);
	while (n>3) {
		     aux1=a[1]+2*a[2]+a[n];
		     aux2=a[n]+2*a[1]+a[n-1];
		     if (aux1 < aux2) s+=aux1; else s+=aux2;
		     n=n-2;
	}
	if (n==3) s+=a[1]+a[2]+a[3]; else
	s+=a[2];
	fout << s;
	return 0;
}