#include <iostream>
#include <fstream>

using namespace std;

const int nmax=16000;
const int vmax=16000;
int v[nmax+1];
int n,k;

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

bool destul (int c)
{
    int nr=0, r=0;
    for (int i=1; i <=n; i++)
    {
        if(v[i]>r)
        {
            nr++;
            r=c;
        }
        r-=v[i];
    }
    return (nr<=k);
}

int main()
{
    ci >> n >> k;
    int r=0,l=0;
    for(int i=1; i<=n; i++)
    {
        ci>>v[i];
        if (v[i]>l)
        {
            l=v[i];
        }
        r+=v[i];
    }
    int n2=1;
    while (n2*2<=r-l+1)
    {
        n2*=2;
    }
    int sol=r+1,n3=n2;
    for (int n3=n2; n3>0; n3/=2)
    {
        if (sol-n3>=l  && destul(sol-n3))
        {
            sol-=n3;
        }
    }
    co << sol;
    return 0;
}