Cod sursă (job #197465)

#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int i,n,a[100001],t1,t2;
long long rez;
int main()
{freopen("lanterna.in", "r", stdin);
freopen("lanterna.out", "w", stdout);
scanf("%d", &n);
for(i=1; i<=n; i++)
    scanf("%d", &a[i]);
sort(a+1,a+n+1);
while(n>3)
    {t1=a[1]+a[2]*2+a[n];
    t2=a[1]*2+a[n-1]+a[n];
    if(t1<t2)
        rez+=t1;
        else
            rez+=t2;
    n-=2;}
if(n==3)
    rez+=a[1]+a[2]+a[3];
    else
        rez+=a[2];
cout<<rez;
    return 0;
}