#include <fstream>

using namespace std;
ifstream cin("transport.in");
ofstream cout("transport.out");
int v[16002];
int main()
{
    int n,k,i,maxi=-1,st,dr;
    cin>>n>>k;
    for(i=1;i<=n;i++)
    {
        cin>>v[i];
        if(v[i]>maxi)
            maxi=v[i]; // aflam maximul
    }
    st=maxi;
    dr=256000000;
    int sol, mij , sum;
    while(st<=dr) // aplicam cautarea binara
    {
        mij=(st+dr)/2;
        sum=1;
        int sumc=0;
        for(i=1;i<=n;i++)
        {
            if(sumc+v[i]<=mij)
                sumc=sumc+v[i];
            else
            {
                sumc=v[i];
                sum++;
            }
        }
        if(sum>k)
            st=mij+1;
        else
        {
            sol=mij;
            dr=mij-1;
        }
    }
    cout<<sol;
    return 0;
}