Pagini recente » Cod sursa (job #1620578) | Cod sursa (job #1671711) | Cod sursa (job #1024577) | Cod sursa (job #318108) | Cod sursa (job #2712560)
#include <fstream>
#include <iostream>
using namespace std;
int v[16001];
ifstream cin("transport.in");
ofstream cout("transport.out");
int main()
{
int n,k,i,st=0,dr,sol,mij,t,s,s2=0;
cin>>n>>k;
for(i=1; i<=n; i++){
cin>>v[i];
if(st<v[i])
st=v[i];
s2+=v[i];
}
dr=s2;
while(st<=dr){
mij=(st+dr)/2;
t=1,s=0;
for(i=1; i<=n; i++){
s=s+v[i];
if(s>mij){
t++;
s=v[i];
}
}
if(t>k){
st=mij+1;
}
else{
dr=mij-1;
sol=mij;
}
}
cout<<sol;
return 0;
}