#include <bits/stdc++.h>

using namespace std;

ifstream fin("transport.in");
ofstream fout("transport.out");
long long n, k, i, m, s, st, dr, mid, tr, cap, v[20002];

int main() {
    fin >> n >> k;
    for(i = 1; i <= n; i++) {
        fin >> v[i];
        s += v[i];
        m = max(m, v[i]);
    }
    st = m;
    dr = s;
    while(st <= dr) {
        mid = st + (dr - st) / 2;
        tr = 1;
        cap = 0;
        for(i = 1; i <= n; i++) {
            cap += v[i];
            if(cap > mid) {
                cap = v[i];
                tr++;
            }
        }
        if(tr < k) dr = mid - 1;
        else st = mid + 1;
    }
    fout << st;

    return 0;
}