#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 998244353;
const int N = 1e6 + 10;
int power(int a, int b) {
  if (!b) return 1;
  int c = power(a, b / 2);
  c = (1LL * c * c) % mod;
  if (b % 2) c = (1LL * c * a) % mod;
  return c;
}
void done() {}
void solve() {
  int n, k;
  cin >> n >> k;
  ll ans = 0;
  ll s = 0;
  while (n--) {
    int x;
    cin >> x;
    s += 1ll * x;
  }
  ans = s / k + (s % k ? 1 : 0);
  cout << ans << '\n';
}
void another() {
  int n, m;
  cin >> n >> m;
  int ans1 = 0;
  int ans2 = 0;
  if (m * 2 < n) {
    ans1 = n - m * 2;
  }
  if (m + 1 < n) {
    ans2 = n - m - 1;
  }
  cout << ans1 << ' ' << ans2 << '\n';
}
void test_case() {
  int t;
  cin >> t;
  while (t--) another();
}
int main() {
  ios::sync_with_stdio(NULL);
  cin.tie(0);
  cout.tie(0);
  solve();
}
