Problem p02598 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>

#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll>
#define vs vector<str>
#define vvs vector<vs>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define vpll vector<pll>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define rep(i, a, b) for (int i = (a); i < int(b); i++)
#define repi(i, a, b) for (int i = (a); i <= int(b); i++)

using namespace std;
ll INF = LONG_LONG_MAX;
ll mod = 1000000000 + 7;

template <typename T, typename L>
void read(vector<T> &_data, L &_size, bool _shift) {
  _data.resize(_size + (ll)_shift);
  for (ll i = (ll)_shift; i < _size + (ll)_shift; i++)
    cin >> _data[i];
}

template <typename T, typename L>
void read(vector<vector<T>> &_data, L &_rows, L &_cols, bool _shiftRows,
          bool _shiftCols) {
  _data.resize(_rows + (ll)_shiftRows);
  for (ll i = 0; i < _rows + (ll)_shiftRows; i++)
    _data[i].resize(_cols + (ll)_shiftCols);
  for (ll i = (ll)_shiftRows; i < _rows + (ll)_shiftRows; i++)
    for (ll j = (ll)_shiftCols; j < _cols + (ll)_shiftCols; j++)
      cin >> _data[i][j];
}

template <typename T> void write(vector<T> &_data, bool _shift) {
  for (ll i = (ll)_shift; i < _data.size(); i++)
    cout << _data[i] << " ";
  cout << endl;
}

// TODO: SOLUTION

ll n, k;
vll a;

void solve() {
  cin >> n >> k;
  read(a, n, 0);

  sort(a.begin(), a.end(), greater<>());

  ll lo = 0;
  ll hi = *max_element(a.begin(), a.end());
  ll best = hi;

  while (lo <= hi) {
    ll mid = (lo + hi) / 2;
    ll touse = k;
    ll i = 0;

    while (i < n && touse >= 0) {
      ll cuts;
      if (a[i] % mid == 0)
        cuts = a[i] / mid - 1;
      else
        cuts = a[i] / mid;
      touse -= cuts;
      i++;
    }

    if (i == n && touse >= 0) {
      best = mid;
      hi = mid - 1;
    } else {
      lo = mid + 1;
    }
  }

  cout << best << endl;
}

int main() {

  // TODO: Set value of this variable manually
  bool _multipleTestCases = false;

  if (_multipleTestCases) {
    ll t;
    cin >> t;
    while (t--)
      solve();
  } else {
    solve();
  }

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>

#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll>
#define vs vector<str>
#define vvs vector<vs>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define vpll vector<pll>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define rep(i, a, b) for (int i = (a); i < int(b); i++)
#define repi(i, a, b) for (int i = (a); i <= int(b); i++)

using namespace std;
ll INF = LONG_LONG_MAX;
ll mod = 1000000000 + 7;

template <typename T, typename L>
void read(vector<T> &_data, L &_size, bool _shift) {
  _data.resize(_size + (ll)_shift);
  for (ll i = (ll)_shift; i < _size + (ll)_shift; i++)
    cin >> _data[i];
}

template <typename T, typename L>
void read(vector<vector<T>> &_data, L &_rows, L &_cols, bool _shiftRows,
          bool _shiftCols) {
  _data.resize(_rows + (ll)_shiftRows);
  for (ll i = 0; i < _rows + (ll)_shiftRows; i++)
    _data[i].resize(_cols + (ll)_shiftCols);
  for (ll i = (ll)_shiftRows; i < _rows + (ll)_shiftRows; i++)
    for (ll j = (ll)_shiftCols; j < _cols + (ll)_shiftCols; j++)
      cin >> _data[i][j];
}

template <typename T> void write(vector<T> &_data, bool _shift) {
  for (ll i = (ll)_shift; i < _data.size(); i++)
    cout << _data[i] << " ";
  cout << endl;
}

// TODO: SOLUTION

ll n, k;
vll a;

void solve() {
  cin >> n >> k;
  read(a, n, 0);

  sort(a.begin(), a.end(), greater<>());

  ll lo = 1;
  ll hi = *max_element(a.begin(), a.end());
  ll best = hi;

  while (lo <= hi) {
    ll mid = (lo + hi) / 2;
    ll touse = k;
    ll i = 0;

    while (i < n && touse >= 0) {
      ll cuts;
      if (a[i] % mid == 0)
        cuts = a[i] / mid - 1;
      else
        cuts = a[i] / mid;
      touse -= cuts;
      i++;
    }

    if (i == n && touse >= 0) {
      best = mid;
      hi = mid - 1;
    } else {
      lo = mid + 1;
    }
  }

  cout << best << endl;
}

int main() {

  // TODO: Set value of this variable manually
  bool _multipleTestCases = false;

  if (_multipleTestCases) {
    ll t;
    cin >> t;
    while (t--)
      solve();
  } else {
    solve();
  }

  return 0;
}