#include <bits/stdc++.h>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int N,K,v[16001],s,Max,Min;
int main()
{
    f>>N>>K;
    for(int i=1;i<=N;++i)
    {
        f>>v[i];
        s+=v[i],Max=max(Max,v[i]);
    }
    int st=Max,dr=Min=s;
    while(st<=dr)
    {
        int mij=(st+dr)/2,sum=0,nr=1;
        for(int i=1;i<=N;++i)
            if(sum+v[i]>mij)++nr,sum=v[i];
        else sum+=v[i];
        if(nr<=K)
        {
            Min=min(Min,mij);
            dr=mij-1;
        }
        else st=mij+1;
    }
    g<<Min;

    return 0;
}