Cod sursă (job #521778)

#include <bits/stdc++.h>

using namespace std;
ifstream in("lanterna.in");
ofstream out("lanterna.out");
long long n,x,l,ans,s1,s2;
int a[100100];
int main()
{
    in>>n;
    for(int i=1;i<=n;i++) in>>a[i];
    sort(a+1,a+n+1);
    l=n;
    while(l>2)
    {
        s1=a[1]+a[2]+a[l]+a[2];
        s2=2*a[1]+a[l]+a[l-1];
        if(s1<s2) ans+=s1;
        else ans+=s2;
        l-=2;
    }
    if(l==2) out<<ans+a[2];
    else out<<ans;
    return 0;
}