Pagini recente » Cod sursa (job #3220628) | Cod sursa (job #3159766) | Cod sursa (job #2164798) | Cod sursa (job #2956472) | Cod sursa (job #2527831)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[17001];
int main()
{
int n,i,k,s,drumuri,mij,st,dr,elem;
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>v[i];
dr=1600000;
st=1;
elem=0;
while(st<=dr){
mij=(dr+st)/2;
s=0;
drumuri=0;
for(i=1;i<=n && v[i]<=mij;i++){
if(s+v[i]<=mij)
s+=v[i];
else{
drumuri++;
s=v[i];
}
}
if(s<=mij)
drumuri++;
if(drumuri>k || i<n+1)
st=mij+1;
else
{
dr=mij-1;
elem=mij;
}
}
cout<<elem;
return 0;
}