Cod sursă (job #506240)

#include <fstream>
#include <algorithm>
using namespace std;
ifstream in ("lanterna.in");
ofstream out ("lanterna.out");
int v[100007],n;
void traversare()
{
    int om=n;
    long long minute=0;
    while(om>=4)
    {
        minute=minute+min(v[1]+2*v[2]+v[om],v[1]*2+v[om-1]+v[om]);
        om-=2;
    }
    if(om==2)
        minute=minute+v[2];
    else minute=minute+v[1]+v[2]+v[3];
    out<<minute;
}
int main()
{
    int i;
    in>>n;
    for(i=1;i<=n;i++)
        in>>v[i];
    sort(v+1,v+n+1);
    traversare();
    return 0;
}