Cod sursă (job #692272)

#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("lanterna.in");
ofstream fout("lanterna.out");
int n,v[100001],d[100001];
long long sum,S;
int main()
{
    fin >> n;
    for(int i=1;i<=n;i++)
    {
        fin >> v[i];
        S+=v[i];
    }
    sort(v+1,v+n+1);
    d[2]=v[2];
    d[3]=v[1]+v[2]+v[3];
    for(int i=4;i<=n;i++)
        d[i]=min(v[1]+v[i]+d[i-1],2*v[2]+v[1]+v[i]+d[i-2]);
    fout << d[n];
    return 0;
}