Cod sursă (job #518552)

#include <iostream>
#include <fstream>
#include <algorithm>


using namespace std;

ifstream fin ("lanterna.in");
ofstream fout ("lanterna.out");
int v[100000];

int main()
{
    int n,i,nr,j,aux,a,b;
    long long timptotal;
    fin >> n;
    for(i=0;i<n;i++)
    {
        fin >> nr;
        v[i]=nr;
    }
    j=0;
    sort (v,v+n);
    timptotal=0;
    for(i=n-1;i>2;i-=2)
    {
        a=v[0]+(v[1]<<1)+v[i];
        b=(v[0]<<1)+v[i-1]+v[i];
        if(a>b)
        {
            timptotal+=b;
        }
        else
        {
            timptotal+=a;
        }
    }

    if(i==2)
    {
        timptotal+=v[0]+v[1]+v[2];
    }
    else
    {
        timptotal+=v[1];
    }

    fout << timptotal;
    return 0;
}