Pagini recente » Cod sursa (job #1873772) | Cod sursa (job #2585508) | Cod sursa (job #1545013) | Cod sursa (job #2319062) | Cod sursa (job #2607670)
#include <bits/stdc++.h>
using namespace std;
const int N = 16010;
int n, k, a[N];
int main(){
ifstream cin ("transport.in");
ofstream cout ("transport.out");
cin >> n >> k;
for (int i=1; i<=n; i++) cin >> a[i];
auto check = [&](int cap)->bool{
int cnt = 1, fil = 0;
for (int i=1; i<=n; i++){
if (cap < a[i]) return 0;
fil += a[i];
if (fil > cap) fil = a[i], cnt++;
}
return cnt <= k;
};
int ans = 0, mx = 16000 * 16000;
for (int i=27; i>=0; i--){
if (ans + (1 << i) <= mx && !check(ans + (1 << i)))
ans += (1 << i);
}
cout << ans + 1;
return 0;
}