Pagini recente » Cod sursa (job #1919699) | Cod sursa (job #1003320) | Cod sursa (job #267978) | Cod sursa (job #1715718) | Cod sursa (job #1830268)
#include <fstream>
using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int n,k,i,v[16001],st,dr,mij,S=0,Max=-1,sum,nr,sol;
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++){
cin>>v[i];
S=S+v[i];
if(v[i]>Max)
Max=v[i];
}
st=Max;
dr=S;
while(st<=dr){
mij=(st+dr)/2;
sum=0;
nr=1;
for(i=1;i<=n;i++){
if(sum+v[i]<=mij)
sum=sum+v[i];
else{
nr++;
sum=v[i];
}
}
if(nr<=k){
sol=mij;
dr=mij-1;
}
else
st=mij+1;
}
cout<<sol;
return 0;
}