Cod sursă (job #121395)

#include<stdio.h>
#include<algorithm>

using namespace std;

long long v[100001];

int main()

{

freopen ("lanterna.in","r",stdin);
freopen ("lanterna.out","w",stdout);

long long n,i,timp=0,s1,s2;

scanf("%lld",&n);

for(i=1;i<=n;i++)
    scanf("%lld",&v[i]);

sort(v+1,v+n+1);

while(n-2>=2){
    s1=v[1]+v[2]+v[2]+v[n];
    s2=v[1]+v[1]+v[n-1]+v[n];
    if(s1<=s2)
        timp+=s1;
    if (s2<s1)
        timp+=s2;
    n-=2;}

if(n==3)
    timp+=v[1]+v[2]+v[3];
if(n==2)
    timp+=v[2];

printf("%lld",timp);

return 0;
}