Cod sursă (job #388632)

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