Cod sursă (job #201273)

#include <fstream>
#include <algorithm>

using namespace std;

int n,a[100001],val1,val2,i;
long long s;

int main()
{
    ifstream f("lanterna.in");
    ofstream g("lanterna.out");
    f>>n;
    for (i=1;i<=n;i++)
        f>>a[i];
    sort(a+1,a+n+1);
    while (n>3)
    {
        val1=a[1]+2*a[2]+a[n];
        val2=2*a[1]+a[n-1]+a[n];
        if (val1<val2) s+=val1;
        else s+=val2;
        n-=2;
    }
    if (n==3) s+=a[1]+a[2]+a[3];
    else s+=a[2];
    g<<s;
    return 0;
}