Cod sursă (job #121387)

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

using namespace std;

int a[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",&a[i]);}
sort(a+1,a+n+1);
while(n-2>=2){
    if(a[1]+2*a[2]+a[n]<=2*a[1]+a[n]+a[n-1])
        timp+=(a[1]+2*a[2]+a[n]);
    else
        timp+=(2*a[1]+a[n]+a[n-1]);
    n-=2;}

if(n==2){
    timp+=a[2];}

printf("%d",timp);

return 0;
}