Cod sursă (job #521971)

#include <bits/stdc++.h>

using namespace std;

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

void usain_bolt()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
}

const int N = 1e5 + 5;

int a[N];

int main()
{
    usain_bolt();

    int n;
    long long sum = 0;

    fin >> n;
    for(int i = 1; i <= n; ++i) fin >> a[i], sum += 1LL * a[i];
    sort(a + 1, a + 1 + n);
    long long mn = 1e18, cnt;

    //1 hamal
    mn = sum + a[1] * (n - 2);
    //1 si 2 hamali
    cnt = mn;
    for(int i = n; i >= 1; i -= 2) {
        cnt -= 1LL * a[i] + 1LL * a[1] - 2LL * a[2];
        mn = min(mn, cnt);
    }
    fout << mn;
    return 0;
}