Pagini recente »
Borderou de evaluare (job #268045)
|
Cod sursă (job #161191)
|
Clasament adunare
|
oni2020
|
Cod sursă (job #545542)
Cod sursă (job
#545542)
#include <bits/stdc++.h>
using namespace std;
int n,i,t[100005];
long long rs;
int main()
{
freopen("lanterna.in","r",stdin);
freopen("lanterna.out","w",stdout);
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
cin>>n;
for(i=1;i<=n;i++)cin>>t[i];
sort(t+1,t+n+1);
while(n>=4)
{
rs+=min(t[1]+2*t[2]+t[n],2*t[1]+t[n]+t[n-1]);
n-=2;
}
if(n==2)rs+=t[2];
if(n==3)rs+=t[1]+t[2]+t[3];
cout<<rs<<endl;
return 0;
}