Cod sursă (job #21670)

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

ifstream in ("lanterna.in");
ofstream out ("lanterna.out");

long long sum=0;
int n,i,v[100001];
int main()
{
    in>>n;
    for(i=1;i<=n;i++)
        in>>v[i];
    sort(v+1,v+n+1);
    i=n;
        while (i>3) {
            if (2*v[2]<v[1]+v[i-1]) sum+=2*v[2]+v[1]+v[i];
            else sum+=2*v[1]+v[i]+v[i-1];
            i-=2;
        }
        if (i==3) sum+=v[1]+v[2]+v[3];
        else sum+=v[2];
        out <<sum;
    return 0;
}