#include<stdio.h>

int n, k;
long long int T[100000];

int check(long long P)
{
	int i = 0, j;
	for(j = 0; j < k; j++)
	{
		long long int s = 0;
		while(s + T[i] <= P)
		{
			s += T[i];
			i++;
			if(i == n)
			{
				return n;
			}
		}
	}
	return i;
}

int solve()
{
	long long int left = 0;
	long long int right = 100000 * 10000;
	long long int mid;
	while(right - left > 1)
	{
		mid = (left + right) / 2;
		int v = check(mid);
		if(v >= n)
		{
			right = mid;
		}
		else
		{
			left = mid;
		}
	}
	return right;
}

int main(void)
{
	int i;
	scanf("%d %d", &n, &k);
	for(i = 0; i < n; i++)
	{
		scanf("%lld", &T[i]);
	}
	long long int c = solve();
	printf("%lld\n", c);
	
	return 0;
}
