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

using namespace std;

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

const int MAXN = 16000;
int v[MAXN];

bool ver(int cant, int k, int n)
{
    int i = 0, drumuri = 0;
    long long sum = 0;

    while(i < n)
    {
        sum = 0;
        if(v[i] <= cant)
        {
            while(sum <= cant && i <= n)
                sum += v[i], i++;
            i--;
        }
        else
            return false;
        drumuri++;
    }
    if(drumuri <= k)
        return true;
    return false;
}


int main()
{
    int n, k, i;
    long long ans = 0LL;

    fin >> n >> k;
    for(i = 0; i < n; i++)
        fin >> v[i];

    long long st = 0, dr = 256000000;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(ver(mij, k, n) == true)
        {
            dr = mij - 1;
            ans = mij;
        }
        else
            st = mij + 1;
    }
    fout << ans;

    return 0;
}