Cod sursă (job #198155)

#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int a[100004],x1,x2,i,n;
long long sum;
int main()
{freopen("lanterna.in","r",stdin);
freopen("lanterna.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
    scanf("%d",&a[i]);
sort(a+1,a+n+1);
while(n>3)
{
    x1=a[1]+2*a[2]+a[n];
    x2=a[1]*2+a[n-1]+a[n];
    if(x1<x2)
        sum+=x1;
    else
        sum+=x2;
    n-=2;
}
if(n==3)
{
    sum+=a[1]+a[2]+a[3];
}
else
    sum+=a[2];
cout<<sum;
    return 0;
}