Pagini recente » Cod sursa (job #2535183) | Cod sursa (job #958285) | Cod sursa (job #47647) | Cod sursa (job #1273825) | Cod sursa (job #1961493)
#include <cstdio>
#include <iostream>
using namespace std;
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int n,l1,l2,elem,m,t,s,i,maxim,v[16001],k;
cin>>n>>k;
l1=0;
l2=0;
for(i=0; i<=n; i++)
{
cin>>v[i];
if(v[i]>l1)
l1=v[i];
l2=l2+v[i];
}
while(l1<=l2)
{
m=(l1+l2)/2;
t=1;
s=0;
for(i=1; i<=n; i++)
if(s+v[i]<m)
s+=v[i];
else
{
t++;
s=v[i];
}
if(t>k)
l1=m+1;
else
{
l2=m-1;
elem=m;
}
}
cout<<elem;
return 0;
}