Cod sursă (job #803039)

#include <bits/stdc++.h>
using namespace std;

int main() {
    ifstream cin("lanterna.in");
    ofstream cout("lanterna.out");
    int N;
    cin >> N;
    vector<int> t(N);
    for (int i = 0; i < N; ++i) {
        cin >> t[i];
    }
    sort(t.begin(), t.end());
    long long total_time = 0;
    int i = N - 1;
    while (i >= 3) {
        int option1 = t[1] + t[0] + t[i] + t[1];
        int option2 = t[i] + t[0] + t[i - 1] + t[0];
        total_time += min(option1, option2);
        i -= 2;
    }
    if (i == 2) {
        total_time += t[2] + t[1] + t[0];
    } else if (i == 1) {
        total_time += t[1];
    } else {
        total_time += t[0];
    }
    cout << total_time;
    return 0;
}