#include <bits/stdc++.h>
using namespace std;

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

int a[16002] , n , k;

int SePoate(int M)
{
    int s = 0 , i , cnt = 1;
    for (i = 1 ; i <= n ; i++)
    {
        if (a[i] > M) return 0;
        if (s + a[i] <= M) s += a[i];
        else
        {
            s = a[i];
            cnt++;
            if (cnt > k) return 0;
        }
    }
    return 1;
}

int CautBin()
{
    int st = 1 , dr = 16000 * 16000 , mij , sol = 0;
    while (st <= dr)
    {
        mij = (st + dr) / 2;
        if (SePoate(mij))
        {
            sol = mij;
            dr = mij - 1;
        }
        else st = mij + 1;
    }
    return sol;
}

int main()
{
    int i;
    fin >> n >> k;
    for (i = 1 ; i <= n ; i++)
        fin >> a[i];
    fout << CautBin();
    return 0;
}