Cod sursă (job #343802)

#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("lanterna.in");
ofstream g ("lanterna.out");
int main()
{
    int i;
    long int t[100000],n,min=999999,max=-1,s=0,min1=999999,p;
    f>>n;
    for(i=0;i<n;i++)
    {
        f>>t[i];
        if(t[i]>max)
            max=t[i];
        if(t[i]<min)
            min=t[i];
    }
    for(i=0;i<n;i++)
    {
        if((t[i]<min1)&&(t[i]>min))
            min1=t[i];
    }
    p=min+(min1+min)-1;
    if(min1-min<n-1)
        s=min1+min+max+min1+min1;
    if(min1-min>=n-1)
        s=min*2+max+min1+p;
    g<<s;
}