//https://www.nerdarena.ro/problema/transport1

//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("fast-math")
//#pragma GCC optimize ("unroll-loops")
//#define _USE_MATH_DEFINES

#include <iostream>
#include <fstream>
//#include <vector>
//#include <cstring>
//#include <cmath>
//#include <bitset>
//#include <queue>
//#include <stack>
//#include <utility>
//#include <algorithm>
//#include <string>
//#include <map>
//#include <unordered_map>
//#include <set>
//#include <unordered_set>
//#include <cstdint>
//#include <climits>
//#include <iomanip>
//#include <cstdio>
//#include <tuple>

using namespace std;

ifstream fin("transport.in");
ofstream fout("transport.out");

const int NRMAX = 16000;

int n, k;
int v[NRMAX + 5];

bool verif(int x)
{
	int sum = 0, tr = 0;

	for (int i = 1; i <= n; ++i)
	{
		if (v[i] > x)
			return false;

		if (sum + v[i] > x)
		{
			sum = 0;
			++tr;

			if (tr > k)
				return false;
		}

		sum += v[i];
	}

	if (sum)
		++tr;

	return (tr <= k);
}

int main()
{
	//ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);
	
	fin >> n >> k;
	for (int i = 1; i <= n; ++i)
		fin >> v[i];

	int st = 1, dr = NRMAX * NRMAX, rez = 0;

	while (st <= dr)
	{
		int mij = (st + dr) / 2;

		if (verif(mij))
		{
			dr = mij - 1;
			rez = mij;
		}
		else
		{
			st = mij + 1;
		}
	}

	fout << rez;

	return 0;
}