#include <iostream>
#include <fstream>
using namespace std;

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

#define N 16005
int n, k, a[N], s[N], maxi;
void citire()
{
    fin >> n >> k;
    for(int i = 1; i <= n; i++)
        {
            fin >> a[i];
            if(a[i] > maxi)
                maxi = a[i];
        }
}

void rezolvare()
{
    for(int i = 1; i <= n; i++)
        s[i] = s[i - 1] + a[i];
    int st = maxi, dr = s[n], sol;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        int cnt = 1, sum = 0;
        for(int i = 1; i <= n; i++)
            if(sum + a[i] <= mij)
                sum += a[i];
            else
            {
                cnt++;
                sum = a[i];
            }
        if(cnt <= k)
        {
            sol = mij;
            dr = mij - 1;
        }
        else
           st = mij + 1;
    }
    fout << sol;
}
int main()
{
    citire();
    rezolvare();
    return 0;
}