#include <fstream>

using namespace std;

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

int v[16005],n,k;

int incape(int mij)
{
                int i=2,sumc=v[1],c=0;
                while(i<=n)
                {
                                if(sumc+v[i]>mij)
                                {
                                                sumc=v[i];
                                                c++;
                                }
                                else
                                                sumc+=v[i];
                                i++;
                }
                c++;
                return c;
}

int main()
{
    int sum=0,maxi=-16001;
    in>>n>>k;
    for(int i=1;i<=n;i++)
    {
                    in>>v[i];
                    sum+=v[i];
                    if(maxi<v[i])
                                maxi=v[i];
    }
    int st,dr,mij,sol;
    st=maxi;
    dr=sum;
    while(st<=dr)
    {
                    mij=(st+dr)/2;
                    if(incape(mij)>k)
                    {
                                    st=mij+1;
                    }
                    else
                    {
                                    dr=mij-1;
                                    sol=mij;
                    }
    }
    out<<sol;
    return 0;
}