Pagini recente » Cod sursa (job #588226) | Cod sursa (job #3270657) | Cod sursa (job #436801) | Cod sursa (job #2434561) | Cod sursa (job #816592)
Cod sursa(job #816592)
#include<stdio.h>
int v[16001];
int main()
{
int n,k,i,s=0,max=0,l1,l2,nr,m;
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
s=s+v[i];
if(v[i]>max)
max=v[i];
}
l1=max-1;
l2=s+1;
while(l1<=l2)
{
m=(l1+l2)/2;
nr=1;
s=0;
for(i=1;i<=n;i++)
{
if(s+v[i]<=m)
s=s+v[i];
else
{
nr++;
s=v[i];
}
}
if(nr<=k)
l2=m-1;
else
l1=m+1;
}
printf("%d",m);
return 0;
}