Pagini recente » Cod sursa (job #882666) | Cod sursa (job #2706631) | Cod sursa (job #1925150) | Cod sursa (job #349712) | Cod sursa (job #2156084)
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n,m,s,c,tr,cc,st,dr,k,i,v[16001];
int main(){
fin>>n>>k;
m=0;
s=0;
for(i=1;i<=n;i++){
fin>>v[i];
if(v[i]>m)
m=v[i];
s+=v[i];
}
st=m; dr=s;
while(st<=dr){
c=(st+dr)/2;
cc=c-v[1];
tr=1;
for(i=2;i<=n;i++){
if(cc>=v[i])
cc-=v[i];
else{
tr++;
cc=c-v[i];
}
}
if(tr>k)
st=c+1;
else
dr=c-1;
}
fout<<st;
return 0;
}