#include <iostream>
#include <fstream>
using namespace std;

int main()
{
    ifstream in("transport.in");
    ofstream out("transport.out");
    int n, k, v[16001],i,maxim=0,p,nr;
    long long S=0,st,dr;
    in>>n>>k;
    for(int i=1; i<=n; i++)
    {
        in>>v[i];
        S=S+v[i];
        if(v[i]>maxim)
            maxim=v[i];
    }
    st=maxim;
    dr=S;
    while(st <= dr)
    {
        int mid=(st+dr)/2;
        S=0;
        p=1;
        for(i=1; i<=n; i++)
        {
            if(S+v[i] <= mid)
                S=S+v[i];
            else
            {
                p++;
                S=v[i];
            }
        }
        if(p<=k)
        {
            nr=mid;
            dr=mid-1;
        }
        else
            st=mid+1;
    }
    out<<nr;

    return 0;
}