Cod sursă (job #195696)

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