Pagini recente » Cod sursa (job #318128) | Cod sursa (job #242681) | Cod sursa (job #2282061) | Cod sursa (job #1759647) | Cod sursa (job #2589775)
#include <fstream>
using namespace std;
int v[16001];
int main()
{
ifstream cin("transport.in");
ofstream cout("transport.out");
int n,k,i,st,dr,mij,poz,nrd,ss;
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>v[i];
st=1;
dr=256000000;
poz=-1;
nrd=0;
while(st<=dr){
mij=(st+dr)/2;
nrd=0;
ss=0;
for(i=1;i<=n;i++){
ss=ss+v[i];
if(ss>mij){
nrd++;
ss=v[i];
}
}
nrd++;
if(nrd>k)
st=mij+1;
else{
poz=mij;
dr=mij-1;
}
}
cout<<poz;
return 0;
}