Cod sursa(job #272690)
#include <stdio.h>
#define K 1<<30
#define N 16003
int n,k,v[N];
int valid(int x){
int t=1,s=0,i;
for(i=1;i<=n;i++){
if(s+v[i]>x) {
t++;
s=0;
}
else s+=v[i];
}
if(t<=x) return 1;
return 0;
}
int main(){
int i,st=1,dr=K,m=0;
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]>m) m=v[i];
}
st=m;
while(st<dr){
m=(st+dr)/2;
if(valid(m)) dr=m;
else st=m+1;
}
if(valid(st)==0) st++;
printf("%d\n",st);
}