#include <bits/stdc++.h>
using namespace std;
ifstream fin ("transport.in");
ofstream fout ("transport.out");
int n, v[16001], sum, maxx, k, vol;
int main()
{
  fin >> n >> k;
  for (int i = 1; i <= n; i++) {
    fin >> v[i];
    sum += v[i];
    if (v[i] > maxx)
      maxx = v[i];
  }
  int st = maxx, dr = sum, mij;
  while (st <= dr) {
    mij = (st + dr) / 2;
    int nr = 1, s = 0;
    for (int i = 1; i <= n; i++) {
      if (s + v[i] <= mij)
        s += v[i];
      else {
        s = v[i];
        nr++;
      }
    }
    if (nr <= k) {
      vol = mij;
      dr = mij - 1;
    }
    else
    st = mij + 1;
  }
  fout << vol;
  return 0;
}