#include <iostream>
#include <fstream>
using namespace std;

ifstream fin ("transport.in");
ofstream fout ("transport.out");

int b[20000], c[20000];

int main() {
    int maxim, a[16001], i, N, K, sol, nc;
    long ld = 200000000, ls, mij;
    fin >> N >> K;

    maxim = 0;
    for (i = 1; i <= N; i++)  {
        fin >> a[i];
        if(a[i] > maxim) {
            maxim = a[i];
        }
    }

    ls = maxim;
    sol = 20000;

    while (ls < ld) {
        mij = (ls + ld) / 2;
        nc = 1;
        b[1] = a[1];
        for (i = 2; i <= N; i++) {
            if (mij - b[nc] >= a[i]) {
                b[nc] += a[i];
            }
            else {
                b[nc] = a[i];
                ++nc;
            }
        }
        if (nc <= K) {
            sol = mij; ld = mij - 1;
        }
         else {
            ls = mij + 1;
        }
    }

    fout << sol;
    return 0;
}