C++ :

#include<bits/stdc++.h>
using namespace std;

int A[105], n, m;

int check(int mid) {
    int k = mid, q = 1;
    for (int i = 1; i <= n; i++) {
        if (k - A[i] >= 0) {
            k -= A[i];
        } else {
            k = mid - A[i];
            if (k < 0)
                return 0;
            q++;
        }
    }
    if (q > m)
        return 0;
    else
        return 1;
}

int main() {
    scanf("%d %d", &n, &m);
    int l = 1, r = 0;
    for (int i = 1; i <= n; i++) {
        scanf("%d", &A[i]);
        r += A[i];
    }
    while (l <= r) {
        int mid = (l + r) / 2;
        if (check(mid))
            r = mid - 1;
        else
            l = mid + 1;
    }
    printf("%d", l);
    return 0;
}