#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define ll long long int

int n,k;
const int MAXN=16000+10;
int st[MAXN];

bool chck(int cap){
    int cnt=0;
    int s=0;
    for(int i=0;i<n;i++){
        if(st[i]>cap)return false;
        if(s+st[i]<=cap){
            s+=st[i];
        }
        else{
            cnt++;
            s=st[i];
        }
    }
    return cnt+1<=k;
}

int main(){
    ifstream in("transport.in");
    ofstream out("transport.out");
    in>>n>>k;
    for(int i=0;i<n;i++)in>>st[i];
    int l=1;
    int r=1e9+10;
    int mid;
    int ans=-1;
    while(l<=r){
        mid=(l+r)/2;
        if(chck(mid)){
            ans=mid;
            r=mid-1;
        }
        else{
            l=mid+1;
        }
    }
    assert(ans!=-1);
    out<<ans<<"\n";
    return 0;
}