#include <fstream>
using namespace std;
ifstream in("transport.in");
ofstream out("transport.out");
int v[16000];

int suficient(int mij, int n, int k) {
	long int s = 0, drum = 1;
	for (int i = 0; i < n; i++) {
		if (s + v[i] <= mij)
			s = s + v[i];
		else {
			drum++;
			s = v[i];
		}
	}
	if (drum <= k)
		return 1;
	else return 0;
}

int main() {
	long int MAX = -16000, MIN = 0, n, k, mi, lo, hi, val = 16000;
	if((n<=16000)&&(k<16000)){
	in >> n >> k;
	for (int i = 0; i < n; i++) {
		in >> v[i];
		MIN = MIN + v[i];
		if (v[i] > MAX)
			MAX = v[i];
	}

	lo = MAX;
	hi = MIN;
	while (lo <= hi) {
		mi = (lo + hi) / 2;
		if (suficient(mi, n, k) == 1) {
			if (mi < val)
				val = mi;
			hi = mi - 1;
		}
		else lo = mi + 1;
	}

	out << val;
	}
	return 0;
}