Cod sursă (job #127764)

#include<cstdio>
#include<algorithm>
using namespace std;
int v[100001];
int main()
{
    freopen ("lanterna.in","r",stdin);
    freopen ("lanterna.out","w",stdout);
    long long n,i,t=0,s1,s2;
    scanf("%lld",&n);
    for(i=1;i<=n;i++)
        scanf("%lld",&v[i]);
    sort(v+1,v+n+1);
    while(n>=4)
    {
        s1=v[1]+v[2]+v[2]+v[n];
        s2=v[1]+v[1]+v[n-1]+v[n];
        if(s1<=s2)
            t+=s1;
        if(s2<s1)
            t+=s2;
        n-=2;
    }
    if(n==3)
        t+=v[1]+v[2]+v[3];
    if(n==2)
        t+=v[2];
    printf("%lld",t);
    return 0;
}