Cod sursă (job #163577)

#include <cstdio>
#include <algorithm>
using namespace std;
int n,primultim,primdoi,total;
int a[100010];
int main()
{
    freopen("lanterna.in","r",stdin);
    freopen("lanterna.out","w",stdout);
    scanf("%d",&n);
    for(int i = 1; i <= n; i++){
        scanf("%d",&a[i]);
    }
    sort(a + 1, a + 1 + n);
    while(n > 3){
        primdoi = a[1] + 2 * a[2] + a[n];
        primultim = 2 * a[1] + a[n - 1] + a[n];
        total += min(primdoi,primultim);
        n -= 2;
    }
    if(n == 3){
        total += a[2] + a[1] + a[3];
    }else{
        total += a[2];
    }
    printf("%d",total);
    return 0;
}