0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-05 01:46:27 +00:00
OI-codes/LibreOJ/10014/10014.cpp
2021-01-03 11:29:16 +08:00

38 lines
657 B
C++

#include <bits/stdc++.h>
using namespace std;
int n, m, a[100005], l, r, mid, ans;
bool check(int x) {
int tot = 0, num = 0;
for (int i = 1; i <= n; i++) {
if (tot + a[i] <= x) {
tot += a[i];
} else {
tot = a[i];
num++;
}
}
return num >= m;
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
l = max(l, a[i]);
r += a[i];
}
while (l <= r) {
mid = l + r >> 1;
if (check(mid)) {
l = mid + 1;
} else {
r = mid - 1;
}
}
cout << l << endl;
return 0;
}