#include <cstdio>
#include <algorithm>
using namespace std;
int f[16005];
int n,k;
inline int f1 (int c)
{
    int i,s,t;
    s=t=0;
    for(i=1; i<=n; ++i)
    {
        if (f[i]>c)
            return k+1;
        if (s+f[i]<=c)
            s+=f[i];
        else
        {
            s=f[i];
            ++t;
        }
    }
    if (s)
        ++t;
    return t;
}
inline int binary_search(int n, int val)
{
    int st,dr,med,last=0;
    st=1;
    dr=16000*16005;
    while(st<=dr)
    {
        med=(st+dr)>>1;
        if (f1(med)<=k)
        {
            last=med;
            dr=med-1;
        }
        else
            st=med+1;
    }
    return last;
}
int main ()
{
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);
    int i;
    scanf("%d%d",&n,&k);
    for(i=1; i<=n; ++i)
        scanf("%d",&f[i]);
    printf("%d\n",binary_search(n,k));
    return 0;
}