Cod sursă (job #561035)

#include <fstream>
#include <algorithm>

#define NMAX 100005

using namespace std;

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

int n;
int v[NMAX];

int main()
{
    f >> n;
    for(int i = 1; i <= n; i++)
        f >> v[i];
    sort(v + 1, v + 1 + n);

    unsigned long long int val = v[1] * (n - 2);
    for(int i = 2; i <= n; i++)
        val += v[i];

    unsigned long long int answer = val;
    for(int i = n - 1; i >= 3; i -= 2)
    {
        val -= v[i] - 2 * v[2] + v[1];
        answer = min(answer, val);
    }

    g << answer;
    return 0;
}