Cod sursă (job #696771)

#include <fstream>
#include <algorithm>
using namespace std;

ifstream in("lanterna.in");
ofstream out("lanterna.out");


long long n ;
long long v [ 100001 ];
int main()
{
    long long cost =  0;
    in >> n ;

    for ( int i = 1; i <= n ; i ++ )
        in >> v [ i ] ;

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

    long long i = n ;
    while ( i > 3   )
    {
       int a = v [ 1 ] + 2 * v [ 2 ] + v [ i ];
       int b = v [ i ] + v [ 1 ] + v [ i - 1 ] + v [ 1 ] ;

       cost += min ( a , b );
       i -= 2;
    }

    if ( i == 3 )
    {
        cost += v [ 1 ] + v [ 2 ] + v [ 3 ];

    }
    else
    {
        cost += v [ 2 ] ;
    }

    out << cost ;



    return 0;
}