Pagini recente » Cod sursa (job #2297034) | Cod sursa (job #938786) | Cod sursa (job #1233402) | Cod sursa (job #2723095) | Cod sursa (job #2955674)
#include <fstream>
using namespace std;
ifstream cin ("transport.in");
ofstream cout ("transport.out");
int v[16001], n, k, dr=16000, st=0, mij, i;
int check(int d){
int cnt=0, cd;
cd=d;
for(i=1; i<=n; i++){
if(d-v[i]<0){
cnt++;
d=cd-v[i];
}
else d=d-v[i];
}
if(d>=0) cnt++;
return cnt;
}
int main(){
cin >> n >> k;
for(i=1; i<=n; i++) cin >> v[i];
while(dr-st>1){
mij=(st+dr)/2;
if(check(mij)>k) st=mij;
else dr=mij;
}
cout << dr;
return 0;
}