#include<bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");

int n, v[17005], k;


int verif(int val)
{
    int sum = 0, ans = 0;
    for (int i = 1; i <= n; i++) {
        if (v[i] > val)
            return 0;

        sum += v[i];
        if (sum > val) {
            sum = v[i];
            ans++;
        }
    }

    if (sum > 0)
        ans++;

    if (ans <= k)
        return 1;

    return 0;
}
int main()
{
    fin >> n >> k;
    for (int i = 1; i <= n; i++) {
        fin >> v[i];
    }

    int st = 1, dr = 99999999, poz = 99999999 + 1;
    while (st <= dr) {
        int mijl = (st + dr) / 2;
        if (verif(mijl)) {
            dr = mijl - 1;
            poz = mijl;
        } else {
           st = mijl + 1;
        }
    }

    fout << poz;
    return 0;
}