#include <bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int n, k, a[16001], maxim;
long long sum;
long long binarysearch()
{
    long long st = maxim - 1, dr = sum + 1;
    long long mid;
    while(dr - st > 1)
    {
        mid = (st + dr) / 2;
        long long suma = 0;
        int cnt = 1;
        for(int i = 1; i <= n; i++)
        {
            if(suma + a[i] > mid)
                cnt++, suma = 0;
            suma += a[i];
        }
        if(cnt > k)
            st = mid;
        else
            dr = mid;
    }
    return dr;
}
int main()
{
    ios::sync_with_stdio(false); fin.tie(0); fout.tie(0);
    fin>>n>>k;
    for(int i = 1; i <= n; i++)
        fin>>a[i], maxim = max(maxim, a[i]), sum += a[i];
    fout<<binarysearch();
    return 0;
}