#include<fstream>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001],i,n,nr,Nr,Max;
long long s,st,dr,mij,sol;
int main()
{
    fin>>n>>Nr;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
        dr=dr+v[i];
        if(v[i]>Max)
            Max=v[i];
    }
    st=Max;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        nr=1;
        s=0;
        for(i=1;i<=n;i++)
            if(s+v[i]<=mij)
                s+=v[i];
            else
            {
                s=v[i];
                nr++;
            }
        if(nr<=Nr)
        {
            sol=mij;
            dr=mij-1;
        }
        else
            st=mij+1;
    }
    fout<<sol;
    return 0;
}