Cod sursă (job #21669)

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

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

long long sum=0;
int n,i,numbers[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*numbers[2]<numbers[1]+numbers[i-1]) sum+=2*numbers[2]+numbers[1]+numbers[i];
            else sum+=2*numbers[1]+numbers[i]+numbers[i-1];
            i-=2;
        }
        if (i==3) sum+=numbers[1]+numbers[2]+numbers[3];
        else sum+=numbers[2];
        out <<sum;
    return 0;
}