Pagini recente »
Borderou de evaluare (job #483669)
|
Cod sursă (job #439711)
Cod sursă (job
#439711)
#include <bits/stdc++.h>
using namespace std;
int v[100001];
int main()
{
ifstream f("lanterna.in");
ofstream g("lanterna.out");
unsigned long long n,i,s1=0,s2=0,total=0;
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
sort(v+1,v+n+1);
while (n>3)
{
s1=2*v[1]+v[n-1]+v[n];
s2=v[1]+2*v[2]+v[n];
if(s1<s2) total=total+s1;
else total=total+s2;
n=n-2;
}
if(n==2) total+=v[2];
else
total+=v[1]+v[2]+v[3];
g<<total;}