#include <iostream>
#include <fstream>
using namespace std;
const int NMAX=16000;
int n, k, v[NMAX];
bool isValidSize(int cap) {
    int i, tr, dim;

    tr = 1;
    dim = cap;

    for (i = 0; i < n && tr <= k; i++) {
        if (dim >= v[i]) {
            dim -= v[i];
        } else {
            tr++;
            dim = cap - v[i];
        }
    }

    return tr <= k;
}

int binSearchSize(int max, int sum) {
    int st, dr, mij;

    st = max - 1;
    dr = sum;

    while (dr - st > 1) {
        mij = (st + dr) / 2;
        if (isValidSize(mij)) {
            dr = mij;
        } else {
            st = mij;
        }
    }

    return dr;
}

int main() {
    ifstream fin("transport.in");
    ofstream fout("transport.out");
    int i, max, sum, ans;
    fin>>n>>k;
    max = sum = 0;
    for (i = 0; i < n; i++) {
        fin>>v[i];
        sum = sum + v[i];
        if (max < v[i]) {
            max = v[i];
        }
    }

    ans = binSearchSize(max, sum);
    fout<<ans;
    return 0;
}