Cod sursă (job #121392)

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

using namespace std;

int v[100001];

int main()

{

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

int n,i,timp=0;

scanf("%d",&n);

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

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

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

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

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

printf("%d",timp);

return 0;
}