Cod sursă (job #440796)

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