#include<algorithm>
#include<fstream>

using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int v[16001];
long long mid, st, dr, c, sum;
int n, k, s, ok, i;

int main()
{
    fin>>n>>k;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
        sum+=v[i];
    }
    st=1;
    dr=sum;
    while(st<=dr)
    {
        mid=(st+dr)/2;
        c=0;s=1;ok=0;
        for(i=1;i<=n;i++)
        {
            if(v[i]>mid)
            {
                ok=1;
                break;
            }
            if(c+v[i]>mid)
            {
                s++;
                c=v[i];
            }
            else
                c+=v[i];
        }
        if(ok==1)
            st=mid+1;
        else
        {
            if(s>k)
                st=mid+1;
            else
                dr=mid-1;
        }
    }
    fout<<st;
    fin.close();
    fout.close();
    return 0;
}