Cod sursă (job #158097)

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