#include <fstream>
#include <vector>

using namespace std;

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

int n, k, cap;
vector <int> v(16001, 0);
vector <int> s(16001, 0);

bool OK(int mid)
{
    int sum = 0;
    int transporturi = 0;
    for(int i = 1; i <= n; ++i)
    {
        if(sum + v[i] <= mid)
        {
            sum += v[i];
            if(i == n)
            {
                transporturi++;
                if(transporturi > k)
                    return 0;
            }
        }
        else
        {
            sum = 0;
            transporturi++;
            i--;
            if(transporturi > k)
                return 0;

        }
    }
    return 1;

}

void cautarebinara()
{
    int st = 0;
    int dr = 100000000;
    int mid;
    while(st <= dr)
    {
        mid = (st + dr) / 2;
        int ok = OK(mid);
        if(ok == 1)
        {
            cap = mid;
            dr = mid - 1;
        }
        else
            st = mid + 1;
    }
}
int main()
{
    fin >> n >> k;
    for(int i = 1; i <= n; ++i)
    {
        fin >> v[i];
        s[i] = s[i - 1] + v[i];
    }
    cautarebinara();
    fout << cap;
    return 0;
}