Pagini recente »
lmk_9_vs
|
Borderou de evaluare (job #174906)
|
Istoria paginii utilizator/ale_demian
|
Istoria paginii runda/vaslui_cls9_23.11
|
Cod sursă (job #521808)
Cod sursă (job
#521808)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("lanterna.in");
ofstream g("lanterna.out");
int n,m,t;
int a[100005];
int c[100005];
int main()
{
f>>n;
for(int i=1;i<=n;++i)f>>a[i];
sort(a+1,a+n+1);
a[n+1]=10000000;
for(int j=n;j>2;--j)
{
c[j]=min(c[j+2]+a[1]+2*a[2]+a[j+1],c[j+1]+a[j]+a[1]);
}
c[1]=c[3]+a[2];
g<<c[1];
}