#include<iostream>
#include <fstream>
using namespace std;

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


int main()
{
    int n,k,v[16001],cap=0,transporturi=0,cap_curent;
    fin>>n;
    fin>>k;
    int s=0;
    for(int i=1;i<=n;i++){
        fin>>v[i];
        if(v[i]>cap)
            cap=v[i];
        s=s+v[i];
    }

    if(cap<s/k){
        cap=s/k;
    }

    while(1){
        cap_curent = 0;
        transporturi = 1;
        for(int i=1;i<=n;i++){
            if(cap_curent+v[i]>cap){
                transporturi++;
                if(transporturi > k){
                    break;
                }
                cap_curent = v[i];
            }else{
                cap_curent = cap_curent + v[i];
            }
        }
        if(transporturi <= k){
            break;
        }
        cap++;
    }

    fout<< cap << endl;

    return 0;
}