Pagini recente » Cod sursa (job #2230128) | Cod sursa (job #1112930) | Cod sursa (job #2774066) | abcdfe | Cod sursa (job #1023732)
#include<stdio.h>
using namespace std;
int v[16001];
int main(){
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
int l1,l2,cap,t,s,i,n,k,elem;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
l1=0;
l2=0;
for(i=1;i<=n;i++)
l2+=v[i];
while(l1<=l2){
cap=(l1+l2)/2;
t=1;
s=0;
for(i=1;i<=n;i++)
if(s+v[i]<=cap)
s+=v[i];
else{
t++;
s=v[i];
}
if(t>k)
l1=cap+1;
else{
l2=cap-1;
elem=cap;
}
}
printf("%d",elem);
return 0;
}