#include <cstdio>
#include <fstream>
#include <climits>
using namespace std;
const int INF=INT_MAX;
int v[16005];
int n;
int ok(int x)
{
    int i,s=0,cnt=0;
    for(i=1;i<=n;++i)
    {
        if(v[i]>x)
            return INF;
        if((s+v[i])<=x)
            s+=v[i];
        else
        {
            cnt++;
            s=v[i];
        }
    }
    if(s<=x)
        cnt++;
    return cnt;
}
int main()
{
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);
    int k,st,dr=0,med,ans=16000,i;
    scanf("%d%d",&n,&k);
    for(i=1;i<=n;++i)
    {
        scanf("%d",&v[i]);
        dr+=v[i];
    }
    st=1;
    while(st<=dr)
    {
        med=(st+dr)/2;
        if(ok(med)!=0)
        {
            if(ok(med)<=k)
            {
                ans=med;
                dr=med-1;
            }
            else
                st=med+1;
        }
        else
            st=med+1;
    }
    printf("%d",ans);
    return 0;
}