Pagini recente » Cod sursa (job #2797615) | Cod sursa (job #900722) | Cod sursa (job #2546738) | Cod sursa (job #784368) | Cod sursa (job #817270)
Cod sursa(job #817270)
#include<stdio.h>
int main(){
int n,m,k,s,l1=0,l2=0,i,nr,v[16001],max=0,cant;
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]);
if(v[i]>max)
max=v[i];
l2+=v[i];
}
l1=max;
while(l1<=l2){
cant=m;
m=(l1+l2)/2;
nr=1;
s=0;
for(i=1;i<=n;i++){
s=s+v[i];
if(s>m){
nr++;
s=v[i];
}
}
if(nr<=k){
l2=m-1;
cant=m;}
else
l1=m+1;
}
if(m<cant)
printf("%d",cant);
else
printf("%d",m);
return 0;
}