Cod sursă (job #545172)

#include <iostream>
#include <fstream>
#include<algorithm>
using namespace std;

int main()
{
    ifstream f("lanterna.in");
    ofstream g("lanterna.out");
    long v[100002],i,n,x,y;
    long long s=0;
    int sem;
    f>>n;
    for(i=1;i<=n;i++)
    f>>v[i];

    sort(v+1,v+1+n);
    while(n>3)
    {
        x=v[1]+2*v[2]+v[n];
        y=v[n]+2*v[1]+v[n-1];
        if(x<y)
        s=s+x;
        else
        s=s+y;
        n=n-2;
    }
    if(n==3)
    s=v[1]+v[2]+v[3]+s;
    else
    s=v[2]+s;
    g<<s;
    return 0;
}