#include <bits/stdc++.h>

using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int sol,n,k,mx,v[20000],i,s,st,dr,mid;
int ok(int x)
{
    int a=x;
    int k1=1;
    for(int i=1; i<=n; i++)
    {
        if(x<v[i])
        {
            x=a;
            k1++;
        }
        x=x-v[i];
        if(k1>k)return 0;
    }
    if(k1>k)return 0;
    return 1;


}

int main()
{
    f>>n>>k;
    for(i=1; i<=n; i++)
    {
        f>>v[i];
        s=s+v[i];
        mx=max(v[i],mx);
    }
    st=mx;
    dr=s;

    while(st<=dr)
    {
        mid=(dr+st)/2;

        if(ok(mid))
        {
            sol=mid;
            dr=mid-1;
        }
        else st=mid+1;


    }g<<sol;
}