#include <iostream>
#include <fstream>

using namespace std;

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

const int DIM = 16005;
int n, k, best, maxim;
int v[DIM];

int load(int x)
{
    int cap = x, nr = 1;
    for (int i = 1; i <= n; i++)
    {
        if (v[i] > cap)
        {
            nr++;
            cap = x;
        }
        cap -= v[i];
    }
    return ((nr > k) ? -1 : nr);
}

void cautBin(int l, int r)
{
    while (l <= r)
    {
        int m = (l + r) >> 1;
        int x = load(m);
        if (x != -1 && x <= k)
        {
            if (m < best)
                best = m;
            r = m - 1;
        }
        else
            l = m + 1;
    }
}

int main()
{
    fin >> n >> k;
    for (int i = 1; i <= n; i++)
    {
        fin >> v[i];
        if (v[i] > maxim)
            maxim = v[i];
    }
    best = DIM * DIM;
    cautBin(maxim, DIM * DIM);
    fout << best;
    return 0;
}