Pagini recente » Cod sursa (job #44632) | Cod sursa (job #1292915) | Cod sursa (job #3243341) | Cod sursa (job #869702) | Cod sursa (job #1538624)
#include <fstream>
using namespace std;
int n,k,i,j,r,mini,v[16005];
int main()
{
ifstream f("transport.in");
ofstream g("transport.out");
f>>n>>k;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<=n-k; i++)
{
mini=16005;
for(j=1; j<=n-i; j++)
{
if(v[j]+v[j+1]<mini)
{
mini=v[j]+v[j+1];
r=j;
}
}
v[r]+=v[r+1];
for(j=r+1; j<=n-i; j++)
v[j]=v[j+1];
}
mini=0;
for(i=1; i<=k; i++)
if(mini<v[i]) mini=v[i];
g<<mini<<'\n';
f.close(); g.close();
}