//g++ 2.cpp -std=c++14 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;

#define fi first
#define se second
#define pb push_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n;
  ll m;
  cin>>n>>m;

  vll a(n);
  rep(i,0,n)cin>>a[i];

  ll ok=0,ng=2e9;
  while(ng-ok>1){
    ll ch=(ok+ng)/2;
    vll b(n);
    rep(i,0,n){
      b[i]=a[i]-ch*m;
    }
    int flg=1;
    ll use=0;

    rep(i,0,n){
      if(b[i]>=0){
        use+=b[i];
      }
      else{
        ll need=-1*b[i];
        if(need>use){
          flg=0;
        }
        use-=need;
      }
    }

    if(flg==1){
      ok=ch;
    }
    else{
      ng=ch;
    }
  }

  cout<<ok<<endl;
}