Cod sursă (job #544727)

#include<bits/stdc++.h>
using namespace std;

int n;
unsigned long long a[100001],t,t1,t2;

int main(){
	ifstream cin("lanterna.in");
	ofstream cout("lanterna.out");
	
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>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])t+=(a[1]+2*a[2]+a[n]);
        else t+=(2*a[1]+a[n]+a[n-1]);
        n-=2;
    }
    if(n==3){
        t+=(a[1]+a[2]+a[3]);
    }
    if(n==2){
        t+=a[2];
    }
    cout<<t;
}