#include <bits/stdc++.h>

using namespace std;

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

int n, k, v[16002], s, maxim = INT_MIN, st, dr;

bool ok(int x)
{
    int suma = 0, contor = 0;

    for (int i = 1; i <= n; i++)
    {
        if (suma + v[i] <= x)
            suma += v[i];
        else
        {
            suma = v[i];
            contor++;
        }
    }
    return (contor < k);
}

int main()
{
    fin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        fin >> v[i];
        s += v[i];
        maxim = max(maxim, v[i]);
    }
    st = maxim, dr = s;

    while (st <= dr)
    {
        int m = (st + dr) / 2;
        if (ok(m))
        {
            dr = m - 1;
        }
        else
        {
            st = m + 1;
        }
    }
    fout << st;

    fin.close();
    fout.close();
    return 0;
}