#include <fstream>

using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int n,k,st,dr,x[16005],a[16005],i,m,best,MAX=0;
bool sepoate(int m)
{
    int i1,i,mut=1;
    for (i=1,i1=0;i<=n;i++)
        if (a[i]-a[i1]>m)
    {
        mut++,i1=i-1;
    }
    if (mut>k) return false;
    else return true;
}
int main()
{
    f>>n>>k;
    for (i=1;i<=n;i++)
        f>>x[i],a[i]=a[i-1]+x[i],MAX=max(MAX,x[i]);
    st=MAX,dr=a[n];
    while(st<=dr)
    {
        m=(st+dr)/2;
        if (sepoate(m)==true) best=m,dr=m-1;
        else st=m+1;
    }
    g<<best;
    return 0;
}