#include <iostream>
#include <fstream>
using namespace std;
#define maxn 16010
int n, k, minim;
int s[maxn];
bool bun(int x)
{
    int i=0, j=0, val=0;
    while (i<=n)
    {
        while (s[i+1]<=val+x) i++;
        val=s[i];
        j++;
    }
    if (j>k) return 0;
    return 1;
}
int main()
{
    ifstream f("transport.in");
    ofstream g("transport.out");
    f>>n>>k;
    int i, x;
    for (i=1;i<=n;i++)
    {
        f>>x;
        s[i]=s[i-1]+x;
    }
    int l=s[1], r=s[n], m;
    minim=s[n]+1;
    s[n+2]=2560003;
    while (l<=r)
    {
        m=(l+r)/2;
        if (bun(m)) { if (m<minim) minim=m; r=m-1;}
            else l=m+1;
    }
    g<<minim<<'\n';
}