#include<cstdio>
using namespace std;
int n,k,maxx,x,s,o;
int v[16003];
int ver(int a)
{
	int sm=0,i;
	o=1;
	for(i=1;i<=n&&o<=k;i++)
	{
		if(sm+v[i]<=a) sm+=v[i];
			else sm=v[i], o++;
	}
	if(i==n+1&&o<=k)
        return 1;
    return 0;
}
int cautbin(int st, int dr)
{
	int mij;
	while(st<=dr)
	{
		mij=(dr+st)/2;
		if(st==dr)
			return st;
		else
			if(ver(mij))
				dr=mij;
			else 
				st=mij+1;
	}
	return 0;
}
int main()
{
	freopen("transport.in","r",stdin);
	freopen("transport.out","w",stdout);
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&x);
		s+=x;
		v[i]=x;
		if(maxx<x) maxx=x; 
	}
	printf("%d",cautbin(maxx,s+1));
	return 0;
}