#include <fstream>
using namespace std;

ifstream fin("transport.in");
ofstream fout("transport.out");

int main()
{
    int N,K,s,maxi,i,st,dr,sol,mijl,v_incarcat,drumuri,v[16000];
    fin>>N>>K;
    s=0; maxi=0;

    for(i=0;i<N;i++)
    {
        fin>>v[i];
        s+=v[i];
        if(v[i]>maxi)
            maxi=v[i];
    }
    st=maxi; dr=s; sol=dr;
    while(st<=dr)
    {
        mijl=(st+dr)/2;
        v_incarcat = 0;
        drumuri = 1;

        for(i=0;i<N;i++)
        {
            if(v_incarcat+v[i]>mijl)
                {
                    drumuri++;
                    v_incarcat=v[i];
                }
            else
                v_incarcat+=v[i];
        }

        if(drumuri<=K)
        {
            sol=mijl;
            dr=mijl-1;
        }
        else
            st=mijl+1;
    }
    fout<<sol;
    return 0;
}