#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k, s[16002], maxi, suma;
int nr_trs(int capacitate)
{
    int ct_part, ct=0;
    bool ok;
    for(int i=1; i<=n; i++)
    {
        ok=0;
        ct_part=s[i];
        while(ct_part<capacitate && i<=n)
        {
            ct_part+=s[i];
            i++;
            ok=1;
        }
        if(ok)
            i--;
        ct++;
    }
    return ct;
}
int main()
{
    int i, st, dr, mijl, sol;
    fin>>n>>k;
    for(i=1; i<=n; i++)
    {
        fin>>s[i];
        if(s[i]>maxi)
            maxi=s[i];
        suma+=s[i];
    }
    st=maxi, dr=suma;
    while(st<=dr)
    {
        mijl=(st+dr)>>1;
        if(nr_trs(mijl)<=k)
        {
            sol=mijl;
            dr=mijl-1;
        }
        else
            st=mijl+1;
    }
    fout<<sol<<'\n';
    return 0;
}