#include <bits/stdc++.h>

using namespace std;
int a[10000004], n, k;
ifstream fin("transport.in");
ofstream fout("transport.out");

int Test(int C)
{
    ///returneaza 1 daca pot imparti vectorul in cel mult k secvente, fiecare secventa avand suma mai mica sau egala cu c
    int s, cnt, i;
    s = 0;
    cnt = 1;
    for( i = 1; i <= n; i++)
    {
        if(a[i] > C) return 0;
        if(s + a[i] <= C) s += a[i];
        else
        {
            cnt++;
            s = a[i];
        }
    }
    return (cnt <= k);

}

int CB()
{
    int st, dr, mij, p;
    st = 1;
    dr = 256000000;
    p = 1;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(Test(mij) == 1)
        {
            p = mij;
            dr = mij - 1;
        }
        else st = mij + 1;
    }
    return p;
}

int main()
{
   int i;
   fin >> n >> k;
   for(i = 1; i <= n; i++)
         fin >>a[i];
    fout << CB();

    return 0;
}