#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int test (int n,int c,int v[])
{
    int i,nr=0,s=0;
    for(i=1;i<=n;i++)
    {
        s+=v[i];
        if(s>c)
        {
            s=v[i];
            nr++;
        }
    }
    return nr;
}
int n,k,i,s,maxim,st,dr,mid,x,v[16002];
int main()
{
    f>>n>>k;
    for(i=1;i<=n;i++)
    {
        f>>v[i];
        if(v[i]>maxim) maxim=v[i];
        s+=v[i];
    }
    st=maxim;
    dr=s;
    while(st<=dr)
    {
        mid=(st+dr)/2;
        x=test(n,mid,v);
        if(x<k)
        {
            dr=mid-1;
        }
        else
            st=mid+1;
    }
    g<<st;
    return 0;
}