#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
int n, m;
int left=0, right=0;
cin >> n >> m;
vector<int> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
left = max(left, v[i]);
right += v[i];
}
int ans = 0;
while (left < right)
{
int mid = (left + right) / 2;
int sum = 0;
int cnt = 1;
for (int i = 0; i < n; i++)
{
if (sum + v[i] > mid)
{
cnt++;
sum = v[i];
}
else
sum += v[i];
}
if (cnt <= m)
right = mid;
else
left = mid + 1;
}
cout << left;
return 0;
}