Cod sursă (job #195682)

#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lanterna.in");
ofstream g("lanterna.out");
long long a[100001],k,OK,i,j,doi,prm,prmpoz,OK1,S,n,s;
int main()
{
    f>>n;
    for(i=1;i<=n;i++)
        f>>a[i];
    k=1;
    do
    {OK=1;
     for(i=1;i<=n-k;i++)
           if(a[i]>a[i+1]) {OK=0;
                             a[0]=a[i];
                             a[i]=a[1+i];
                             a[i+1]=a[0];}
      k++;
    }while(OK==0);
    OK1=1;
    s=1;
    while(OK1==1)
    {  doi=0;
        for(i=1;i<=n&&doi==0;i++)
            if(a[i]) {if(prm==0) {prm=a[i];
                                prmpoz=i;
                                 a[i]=0;}
                        else if(doi==0 && i!=prmpoz) {doi=a[i];
                                          a[i]=0;}}

        S+=doi;
        S+=prm;
        a[prmpoz]=prm;
        ++s;
        if(s==n) OK1=0;

    }
    g<<S-prm;
    return 0;
}