Cod sursă (job #567785)

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

using namespace std;

const int NMAX = 1e5;

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

int v[NMAX+1];

int main()
{
    int n;
    long long sum;
    fin >> n;
    for(int i = 1; i <= n; i++)fin >> v[i];
    sort(v + 1, v + n + 1);
    sum = 0;
    for(int i = n; i > 3;i -= 2)sum += (long long)min(2 * v[1] + v[i] + v[i - 1], v[1] + v[2] * 2 + v[i]);
    sum += v[2] + (v[1] + v[3]) * (i - 2);
    fout << sum;
    return 0;
}