#include<fstream>

using namespace std;

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

const int maxN=16000+5;

int v[maxN],n,k,sol;

int main()
{
    fin>>n>>k;

    int maxim=0;

    for(int i=1;i<=n;i++)
    {
        fin>>v[i];

        maxim=max(maxim,v[i]);

    }
    int st=maxim,dr=(1e9); //1e9=10^9, un miliard

    while(st<=dr)
    {
        int mid=(st+dr)/2;

        int transporturi=1;
        int ocupat=0;

        for(int i=1;i<=n;i++)
        {
            if(ocupat+v[i]<=mid)
                ocupat+=v[i];
            else
            {
                ocupat=v[i];
                transporturi++;
            }
        }

        if(transporturi<=k)
        {
            sol=mid;
            dr=mid-1;
        }
            else st=mid+1;
    }

    fout<<sol<<'\n';
    return 0;
}