#include <bits/stdc++.h>
using namespace std;

ifstream f("transport.in");
ofstream g("transport.out");

int n, k;
int a[16006], maxi;

int drumuri(int v)
{
    int rez=0;
    int s=0;
    for (int i=1; i<=n; ++i)
    {
        if (s+a[i]>v)
        {
            s=a[i];
            rez++;
        }
        else
            s+=a[i];
    }
    if (s)
        rez++;
    return rez;
}

int cautare_binara(int st, int dr)
{
    int mij;
    int mini=0x3f3f3f3f;
    int nr_d;
    while (st<=dr)
    {
        mij=(st+dr)/2;
        if (mij<maxi)
        {
            st=mij+1;
        }
        else
        {
            nr_d=drumuri(mij);
            if (nr_d<=k && mij<mini)
                mini=mij;
            if (nr_d<k)
                dr=mij-1;
            else
                st=mij+1;

        }
    }
    return mini;
}

int main()
{
    f >> n >> k;
    for (int i=1; i<=n; ++i)
    {
        f >> a[i];
        if (a[i]>maxi)
            maxi=a[i];
    }
    g << cautare_binara(1,16000);
    return 0;
}