Pagini recente » Summer Challenge 2009, Runda 2 | Monitorul de evaluare | Rating Gutsu Pavel (levap15) | Profil DenisONIc | Cod sursa (job #2998857)
#include <iostream>
#include<math.h>
#include<fstream>
using namespace std;
ifstream f("barman.in");
ofstream g("barman.out");
int main()
{
int n, v[10000],i,j,aux,dif, timp=0,cam, tav,maxi=0,imax=0,imin=0,mini;
f>>n;
for(i=1;i<=n;i++){
f>>v[i];
}
mini=v[1];
for(i=1;i<=n-1;i++){
for(j=i+1;j<=n;j++)
if(v[i]>v[j]){
aux=v[i];
timp=timp+10;
v[i]=v[j];
timp=timp+10;
v[j]=v[i];
timp=timp+10;
}
}
for(i=1;i<=n;i++){
if(v[i]<mini){
mini=v[i];
imin=i;
}
if(v[i]>maxi){
maxi=v[i];
imax=i;
}
}
dif=abs(imin-imax);
timp=timp+dif+10;
g<<timp;
return 0;
}