#include <iostream>
#include <fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int N,K,V[16005];
int sol;
int st=1,dr=16000,mid,maxim=-1;;
int isgood(int D)
{
    int S=0,nr=0;
    //cout<<maxim<<" "<<D<<endl;
    if(maxim>D) return 0;
    for(int i=1; i<=N; i++)
    {
        if(S+V[i]>D)
        {
            nr++;
            S=0;
        }
        S+=V[i];
    }
    if(S>0)
        nr++;
    if(nr<=K) return true;
        return false;
}
int main()
{
    f>>N>>K;
    for(int i=1; i<=N; i++)
    {
        f>>V[i];
        maxim=max(maxim,V[i]);
    }
    while(st<=dr)
    {
        mid=(st+dr)/2;
         //cout<<mid<<" "<<isgood(mid)<<endl;
        if(isgood(mid))
        {
            sol=mid;
            dr=mid-1;
        }
        else
        st=mid+1;
        //cout<<st<<" "<<dr<<endl;
    }
    g<<sol;
}