Pagini recente »
Borderou de evaluare (job #357777)
|
Cod sursă (job #343917)
Cod sursă (job
#343917)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("lanterna.in");
ofstream g ("lanterna.out");
long int n,k,i;
long long int mini=1000000,x[100000],dist;
//long long int mini=1000000,x,y,dist;
/*int lanterna (long long int x,int n)
{
if(n>=0)
{f>>x;
if(x<mini)
{
mini=x;
}
lanterna(x,n-1);}
if(mini!=x)
{
dist=dist+x+mini;
}
cout<<dist<<" ";
}*/
int main()
{
/* f>>n;
lanterna(x,n);
dist=dist-mini;
g<<dist;*/
f>>n;
for(i=1;i<=n;i++)
{
f>>x[i];
if(x[i]<mini) mini=x[i];
}
for(i=1;i<=n;i++)
{
if(mini!=x[i]) dist=dist+x[i]+mini;
}
dist=dist-mini;
g<<dist;
}