#include <fstream>
using namespace std;

ifstream cin("transport.in");
ofstream cout("transport.out");

int X[16005];
int main()
{
    int n, k;
    cin>>n>>k;
    int head=1, tail=0, mid=0;
	for (int i=1; i<=n; i++) {
		cin>>X[i];
		tail=max(tail, X[i]);
	}
	while (head<=tail) {
		int x=0, vol=0;
		mid=head+(tail-head)/2;
		for (int i=1; i<=n; i++) if (vol+X[i]>mid) x++, vol=X[i]; else vol=vol+X[i];
		x++;
		if (x<k) tail=mid-1;
		else head=mid+1;
	}
	mid=head+(tail-head)/2;
	cout<<mid;
    return 0;
}