#include <bits/stdc++.h>

using namespace std;

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

int v[16001];

int main()
{
    int n,k,i,s=0,st,dr,mid,cap=0,maxi=-1,nr=0;

    in >> n >> k ;
    for (i=1; i<=n; i++)
    {
        in >> v[i];
        s+=v[i];
        maxi=max(maxi, v[i]);
    }
    st=maxi;
    dr=s;
    s=0;
    while (st<=dr)
    {
        cap=1;
        s=0;
        mid=st+(dr-st)/2;
        for (i=1; i<=n; i++)
        {
            if (s+v[i]<=mid)
            {
                s+=v[i];
            }
            else
            {
                s=v[i];
                cap++;
            }
        }
        if (cap>k)
        {
            st=mid+1;
        }
        else
        {
            nr=mid;
            dr=mid-1;
        }
    }
    out << nr;
    return 0;
}