简单

#include<bits/stdc++.h>
using namespace std;
int n, m, a[100005];
bool func(int x) {
for (int i = 1; i <= n; i++) {
int j = i, sum = 0;
cnt++;
while (j <= n && sum + a[j] <= x)
sum += a[j++];
i = j - 1;
}
return cnt <= m;
}
int main(){
cin >> n >> m;
int maxn = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
maxn = max(maxn,a[i]);
}
int l = maxn, r = 1e9, ans;
while (l <= r) {
int mid = (l + r) / 2;
if (func(mid)) {
r = mid - 1;
ans = mid;
}
else l = mid + 1;
}
cout << ans;
return 0;
}