#include <fstream>
#include <algorithm>

using namespace std;

ifstream cin("transport.in");
ofstream cout("transport.out");

long long v[17001];
int main()
{
    int n,i,k,s,drumuri;
    long long dr,mij,st,elem;
    cin>>n>>k;
    cin>>v[1];
    st=v[1];
    for(i=2;i<=n;i++){
        cin>>v[i];
        st=max(st,v[i]);
        dr+=v[i];
    }
    dr=256000000;
    elem=0;
    while(st<=dr){
        mij=(dr+st)/2;
        s=0;
        drumuri=1;
        for(i=1;i<=n;i++){
            if(s+v[i]<=mij)
                s+=v[i];
            else{
                drumuri++;
                s=v[i];
            }
        }
        if(drumuri>k)
            st=mij+1;
        else
        {
            elem=mij;
            dr=mij-1;
        }

    }
    cout<<st;
    return 0;
}