Pagini recente » Cod sursa (job #2867853) | Cod sursa (job #892832) | Cod sursa (job #1567540) | Cod sursa (job #1138598) | Cod sursa (job #2388046)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("transport.in");
ofstream out("transport.out");
const int NMAX=16000;
int n,k,v[NMAX+5];
int ok(int c){
int s,i,tr;
tr=s=0;
for(i=1;i<=n;i++){
if(v[i]>c)
return NMAX+1;
if(s+v[i]<=c)
s+=v[i];
else{
s=v[i];
tr++;
}
}
tr++;
return tr;
}
int bsl (int st,int dr){
int med,last=1;
while(st<=dr){
med=(st+dr)/2;
if(ok(med)<=k){
last=med;
dr=med-1;
}
else
st=med+1;
}
return last;
}
int main()
{
int s,i;
in>>n>>k;
s=0;
for(i=1;i<=n;i++){
in>>v[i];
s+=v[i];
}
out<<bsl(1,s);
return 0;
}