Pagini recente » Cod sursa (job #2025949) | Cod sursa (job #1010398) | Cod sursa (job #2074429) | Autentificare | Cod sursa (job #213714)
Cod sursa(job #213714)
#include<stdio.h>
long n,k,i,a[17000],st,dr,p,m,s,l;
int main()
{
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
scanf("%ld%ld",&n,&k);
for(i=1;i<=n;++i)
{scanf("%ld",&a[i]);if(a[i]>st)st=a[i];dr+=a[i];}
p=0;
while(st<=dr)
{m=(st+dr)/2;
s=0;
l=1;
for(i=1;i<=n;++i)
{if(s+a[i]>m){++l;s=a[i];}
else s+=a[i];}
if(l<=k){p=m;dr=m-1;}
else st=m+1;
}
printf("%ld\n",p);
return 0;
}