Pagini recente » Cod sursa (job #3364678) | Cod sursa (job #3367727) | Cod sursa (job #3368027) | Cod sursa (job #3367885) | Cod sursa (job #3367849)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int main()
{
int n, k, v[16001];
cin>>n>>k;
int st=-1, dr=0;
for(int i = 1; i <= n; i++) {
cin>>v[i];
if(v[i]>st){
st=v[i];
}
dr=dr+v[i];
}
int sol = -1;
while(st<=dr) {
int m=(st+dr)/2;
int nrt=1;
int s=0;
for(int i=1;i<=n;i++){
if(s+v[i]<=m){
s=s+v[i];
}
else{
s=v[i];
nrt++;
}
}
if(nrt>k){
st=m+1;
}
else{
sol=m;
dr=m-1;
}
}
fout<<sol;
return 0;
}