#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");

int N, K, a[16099], Max;
long long s, sol=999999999999;


int main()
{
    f>>N>>K;
    for (int i=1; i<=N; i++)
        f>>a[i], Max=max(Max, a[i]), s+=a[i];

    int st=Max, dr=s;
    while (st<=dr)
    {
        int mij=(st+dr)/2;
        int t=1, sum=0;
        for (int i=1; i<=N; i++)
            if (sum+a[i]<=mij) sum+=a[i];
                else ++t, sum=a[i];
        if(t<=K)
        {
            if(mij<sol) sol=mij;
            dr=mij-1;
        }
        else st=mij+1;
    }
    g<<sol<<'\n';
    return 0;
}