using namespace std;
#include<fstream>
const int NMAX1=256000000,NMAX2=16005;
int v[NMAX2], N,K, i;

int numar(int m)
{
	int s=0,nr=0,i=1;
	while(i<=N)
	{
		if(s<=m)
		{	
			s+=v[i];
			i++;
		}
		else
		{
			nr++;s=0;
		}
	}
	return nr;
}

int cautare(int p, int u)
{
	int m=(p+u)/2;
	while(p!=u)
	{
		m=(p+u)/2;
		if(numar(m)<=K)
			u=m;
		else
			p=m+1;
	}
	if(numar(p)<K)
		return m+1;
	else
		return m;
}

int main()
{
	int max=0;
	ifstream in("transport.in");
	ofstream out("transport.out");
	in>>N>>K;
	for(i=1;i<=N;++i)
	{	
		in>>v[i];
		if(v[i]>=max)
			max=v[i];
	}
	out<<cautare(max,NMAX1)<<'\n';
	in.close();out.close();
	return 0;
}