/*
http://www.infoarena.ro/problema/transport
*/

#include <cstdio>
#include <algorithm>
using namespace std;
const int N_MAX = 16000;

int verif(int *v, int v_len, int c) {
    int s = 0, t = 1;
    for (int i = 0; i < v_len; i++) {
        if (v[i] > c) return -1;
        if (s + v[i] > c) {
            s = v[i];
            t++;
        } else {
            s += v[i];
        }
    }

    return t;
}

int main() {
    freopen("transport.in", "r", stdin);
    freopen("transport.out", "w", stdout);

    int N, K;
    scanf("%d%d", &N, &K);

    int v[N_MAX], total = 0;
    for (int i = 0; i < N; i++) {
        scanf("%d", &v[i]);
        total += v[i];
    }

    int step = 1 << 28, pos = 0;
    int final = total;
    while (step >>= 1) {
        if (pos + step <= total) {
            int test = verif(v, N, pos + step);
            if (test >= K) {
                pos += step;
                final = min(final, pos);
            }
        }
    }

    printf("%d\n", final);

    return 0;
}