Pagini recente » Cod sursa (job #1256835) | Cod sursa (job #2858267) | Cod sursa (job #2910693) | Cod sursa (job #1068815) | Cod sursa (job #1014437)
#include <fstream>
#include<iostream>
using namespace std;
int v[16001];
int n,elem,k,i,cap,trans,l1,l2,m,s;
int main(){
freopen("transport.in","r",stdin);
freopen("transport.out","w",stdout);
cin>>n>>k;
s=0;
for(i=1;i<=n;i++){
cin>>v[i];
s+=v[i];
//if(max<v[i])
// max=v[i];
}
l1=0;
l2=s;
while(l1<l2){
m=(l1+l2)/2;
trans=1;
cap=0;
for(i=1;i<=n;i++)
if(cap+v[i]<=m)
cap+=v[i];
else{
trans++;
cap=v[i];
}
if(trans>k){
l1=m+1;
}
else{
l2=m-1;
// elem=m;
}
}
cout<<l1;
return 0;
}