#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define mp make_pair
#define CHECK(x) if(!(x)) return false;
#define CHECKRET(x, y) if(!(x)) return (y);
#define SKIP(x) if((x)) continue;
typedef pair<int, int> pii;

#ifdef INFOARENA
#define ProblemName "transport"
#else
#define ProblemName "fis"
#endif

#define InFile ProblemName ".in"
#define OuFile ProblemName ".out"

const int MAXN = 16010;
int v[MAXN];
int N, K;

bool ok(int C) {
  int ans = 1;
  int c = 0;
  for (int i = 0; i < N; ++i) {
    if (c + v[i] <= C) {
      c += v[i];
      continue;
    }
    c = v[i];
    ++ans;
  }
  return ans <= K;
}

int binSrch() {
  int l = *max_element(v, v + N), r = MAXN * MAXN;
  int found = -1;
  while (l <= r) {
    int mid = l + (r - l) / 2;
    if (ok(mid)) {
      found = mid;
      r = mid - 1;
    }
    else l = mid + 1;
  }
  return found;
}

int main() {
  assert(freopen(InFile, "r", stdin));
  assert(freopen(OuFile, "w", stdout));
  scanf("%d%d", &N, &K);
  for (int i = 0; i < N; ++i)
    scanf("%d", &v[i]);
  printf("%d\n", binSrch());
  return 0;
}