#include <iostream>
#include <fstream>
using namespace std;
long long a[16100],n,i,k,st,dr,s,m,c;
int calc(int p)
{
    int k=0;
    int s=0;
    for(i=1;i<=n;i++)
    {
        if(s+a[i]>p) k++,s=a[i];
        else s+=a[i];
    }
    return k+1;
}
int main()
{
    freopen("transport.in","r",stdin);
    freopen("transport.out","w",stdout);
    cin>>n>>k;
    for(i=1;i<=n;i++) cin>>a[i],s+=a[i];
    st=1;
    dr=s;
    while(st<=dr)
    {
        m=(st+dr)/2;
        s=calc(m);
        if(s>k) st=m+1;
        else c=m,dr=m-1;
    }
    cout<<c;
    return 0;
}