#include <fstream>
using namespace std;

ifstream cin ("transport.in");
ofstream cout("transport.out");

int n, k;
int v[16001];

bool verifica(int cantitate)
{
  int transporturi = 1; int marfa = 0;
  for (int i = 1; i <= n; ++i)
    {
      if (marfa + v[i] <= cantitate)
	marfa += v[i];
      else
	{
	  marfa = 0;
	  --i;
	  ++transporturi;
	}
    }
  
  if (transporturi <= k)
    return true;
  return false;
}

int binarySearch (int stanga, int dreapta, int lastMijloc)
{
  if (stanga > dreapta)
    return stanga;

  int mijloc = (stanga + dreapta) / 2;

  if (verifica (mijloc) == true)
    return binarySearch (stanga, mijloc - 1, mijloc);
  else
    return binarySearch (mijloc + 1, dreapta, mijloc);
}

int main()
{
  cin >> n; 
  cin >> k;

  int suma = 0; int maxim = 0;
  for (int i = 1; i <= n; ++i)
    {
      cin >> v[i];
      suma += v[i];

      if (maxim < v[i])
	maxim = v[i];
    }

  cout << binarySearch (maxim, suma, (maxim + suma) / 2);

  return 0;
}