Cod sursă (job #292794)

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