#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,v[16001],s=0,max1,kk,p=0,r;
int main()
{
    f>>n>>k;
    for(int i=1;i<=n;i++)
        {f>>v[i];
        if(max1<v[i]) max1=v[i];
        s=s+v[i];}
    int hi,lo,mid;
    hi=s;
    lo=max1;
    while(lo<=hi)
    {
        kk=0;
        mid=lo+(hi-lo)/2;
        for(int i=1;i<=n;i++)
        {
            if(p+v[i]<mid)
            p=p+v[i];
            else {p=v[i];kk++;}
        }
    if(kk>k) lo=mid+1;
    else {hi=mid-1; r=mid;}
    }
    g<<mid;

    return 0;
}