Pagini recente » Cod sursa (job #2031799) | Cod sursa (job #865752) | Cod sursa (job #1854197) | Cod sursa (job #2534175) | Cod sursa (job #1526613)
#include<cstdio>
using namespace std;
long long v[17000];
int main(){
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
long long n,k,i,s=0,l1,l2,m,nr,c,elem;
scanf("%lld%lld",&n,&k);
for(i=1;i<=n;i++){
scanf("%lld",&v[i]);
s+=v[i];
}
l1=1;
l2=s;
while(l1<=l2){
m=(l1+l2)/2;
nr=1;
c=0;
for(i=1;i<=n;i++)
if(c+v[i]<=m)
c+=v[i];
else{
c=v[i];
nr++;
}
if(nr>k)
l1=m+1;
else{
l2=m-1;
if(m<elem)
elem=m;
}
}
printf("%lld",elem);
return 0;
}