#include <fstream>
using namespace std;

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

int s[16003], n, k;

int main()
{
    fin>>n>>k;
    int st=0;
    for(int i=1;i<=n;++i)
    {
        int x;
        fin>>x;
        st=max(st, x);
        s[i]=s[i-1]+x;
    }
    int dr=s[n], last=dr;
    while(st<=dr)
    {
        int m=(st+dr)/2;
        int j=0, kt=1;
        for(int i=1;i<=n;++i)
            if(s[i]-s[j]>m) j=i-1, kt++;
        if(kt>k) st=m+1;
        else last=m, dr=m-1;
    }
    fout<<last<<"\n";
    return 0;
}