#include<bits/stdc++.h>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");

long long n, v[200005], k, sum[200005];

long long verif(long long poz)
{
    long long curr_sum = 0, ans = 1;
    for (int i = 1; i <= n; i++) {
        if (curr_sum + v[i] <= poz)
            curr_sum += v[i];
        else {
            curr_sum = v[i];
            ans++;
        }
    }

    return ans;
}

int main()
{
    fin >> n >> k;
    for (long long i = 1; i <= n; i++) {
        fin >> v[i];
        sum[i] = sum[i - 1] + v[i];
    }

    long long st = 1, dr = sum[n], poz = 0;
    while (st <= dr) {
        long long mijl = (st + dr) / 2;
        if (verif(mijl) > k) {
            st = mijl + 1;
        } else {
           dr = mijl - 1;
            poz = mijl;
        }
    }

    fout << poz;
    return 0;
}