#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

int main()
{
    int n, k;
    fin >> n >> k;
    int v[16001];
    int s = 0, maxim, solutie, m, cnt, volum;
    for(int i = 0; i < n; ++i)
    {
        fin >> v[i];
        s += v[i];
    }
    maxim = *max_element(v, v+n);

    while(maxim <= s)
    {
        m = maxim + (s - maxim) / 2;
        cnt = 1;
        volum = 0;

        for(int i = 0; i < n; ++i)
        {
            if(volum + v[i] > m)
            {
                volum = v[i];
                cnt++;
            }
            else{
                volum += v[i];
            }
        }
        if(cnt > k)
            maxim = m + 1;
        else{
            s = m - 1;
            solutie = m;
        }
    }

    fout << solutie;
    return 0;
}