Cod sursă (job #559396)

#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,x,y,a[100001];
long long s;
FILE*in=fopen("lanterna.in","r");
FILE*out=fopen("lanterna.out","w");
int main()
{
    fscanf(in,"%d",&n);
    for(i=1;i<=n;i++)
    {
        fscanf(in,"%d",&a[i]);
    }
    sort(a+1,a+n+1);
    while(n>3)
    {
        x=a[1]+2*a[2]+a[n];
        y=2*a[1]+a[n-1]+a[n];
        s=s+min(x,y);
        n=n-2;
    }
    if(n==3)
    {
        s=s+a[1]+a[2]+a[3];
    }
    else
    {
        s=s+a[2];
    }
    fprintf(out,"%lld",s);
}