#include<fstream>
#include<string.h>
#include<ctype.h>
#include<iostream>
#include<algorithm>
#include<map>
#include<unordered_map>
#include<array>
#include<deque>
#include<math.h>
#include<unordered_set>
#include<set>
#include<iomanip>
#include<bitset>
using namespace std;
int n,k,vol[16160],i,max1,l,r,mid;
int checktruck(int nr)
{
	int curr = 0,nrt=1;
	for (i = 1; i <= n; i++)
	{
		if (curr + vol[i] <= nr)
			curr += vol[i];
		else
		{
			nrt++;
			curr = vol[i];
		}
		if (nrt > k)
			return 0;
	}
	return 1;
}
int main()
{
	//ifstream f("file.in");
	//ofstream g("file.out");
	ifstream f("transport.in");
	ofstream g("transport.out");
	f >> n >> k;
	for (i = 1; i <= n; i++)
	{
		f >> vol[i];
		max1 = max(max1, vol[i]);
	}
	l = max1;
	r = max1*n;
	while (l <= r)
	{
		mid = (l + r) / 2;
		if (checktruck(mid))
			r = mid - 1;
		else
			l = mid + 1;
	}
	if (checktruck(r))
	{
		g << r;
		return 0;
	}
	else
		g << l;
 	return 0;
}