Cod sursă (job #446289)

#include<bits/stdc++.h>
using namespace std;
#define danielsoc 100005
int a[danielsoc],n;long long rs;
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])rs+=(a[1]+2*a[2]+a[n]);
        else rs+=(2*a[1]+a[n]+a[n-1]);
        n-=2;
    }
    if(n==3){
        rs+=(a[1]+a[2]+a[3]);
    }
    if(n==2){
        rs+=a[2];
    }
    cout<<rs;
	return 0;
}