Problem p02598 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
using namespace std;
#define ll long long
void A() {
  int x;
  cin >> x;
  if (x >= 30)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
void B() {
  ll n, d;
  cin >> n >> d;
  int res = 0;
  for (int i = 0; i < n; i++) {
    ll x, y;
    cin >> x >> y;
    if (x * x + y * y <= d * d)
      res++;
  }
  cout << res << endl;
}
void C() {}
void D() {
  int n;
  string s;
  cin >> n;
  cin >> s;
  stack<int> st;
  for (int i = 0; i < n; i++) {
    if (s[i] == 'R')
      st.push(i);
  }
  int l = 0, r = n - 1;
  int res = 0;
  for (int i = 0; i < n && !st.empty(); i++) {
    if (i >= st.top())
      break;
    if (s[i] == 'W') {
      st.pop();
      res++;
    }
  }
  cout << res << endl;
}
void E() {
  ll n, k;
  cin >> n >> k;
  vector<ll> a(n, 0);
  ll ma = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    ma = max(ma, a[i]);
  }
  if (k == 0) {
    cout << ma << endl;
    return;
  }
  ll l = 0, r = ma; //*1.0;
  ll ans = 0;
  while (l < r) {
    // cout<<l<<" "<<r<<endl;
    ll mid = l + (r - l) / 2;
    if (mid == 0) {
      l = 1;
      break;
    }
    ll cnt = 0;
    for (ll i : a) {
      cnt += (i - 1) / mid;
    }
    if (cnt <= k) {
      ans = mid;
      r = mid;
    } else
      l = mid + 1;
  }
  cout << l << endl;
}
void F() {}
void helper() {
  ll r = 1;
  while (r < LONG_LONG_MAX / 100) {
    vector<ll> res;
    for (ll i = 1; i * i <= r; i++) {
      if (r % i == 0) {
        res.push_back(i);
        if (r / i != i)
          res.push_back(r / i);
      }
    }
    sort(res.begin(), res.end());
    for (ll i : res)
      cout << i << " ";
    cout << endl;
    r = r * 10 + 1;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  //    helper();
  E();
  return 0;
}


Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
#define ll long long
void A() {
  int x;
  cin >> x;
  if (x >= 30)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
void B() {
  ll n, d;
  cin >> n >> d;
  int res = 0;
  for (int i = 0; i < n; i++) {
    ll x, y;
    cin >> x >> y;
    if (x * x + y * y <= d * d)
      res++;
  }
  cout << res << endl;
}
void C() {}
void D() {
  int n;
  string s;
  cin >> n;
  cin >> s;
  stack<int> st;
  for (int i = 0; i < n; i++) {
    if (s[i] == 'R')
      st.push(i);
  }
  int l = 0, r = n - 1;
  int res = 0;
  for (int i = 0; i < n && !st.empty(); i++) {
    if (i >= st.top())
      break;
    if (s[i] == 'W') {
      st.pop();
      res++;
    }
  }
  cout << res << endl;
}
void E() {
  ll n, k;
  cin >> n >> k;
  vector<ll> a(n, 0);
  ll ma = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    ma = max(ma, a[i]);
  }
  if (k == 0) {
    cout << ma << endl;
    return;
  }
  ll l = 0, r = ma; //*1.0;
  ll ans = 0;
  while (l < r) {
    // cout<<l<<" "<<r<<endl;
    ll mid = l + (r - l) / 2;
    ll cnt = 0;
    for (ll i : a) {
      cnt += (i - 1) / mid;
    }
    if (cnt <= k) {
      ans = mid;
      r = mid;
    } else
      l = mid + 1;
  }
  cout << l << endl;
}
void F() {}
void helper() {
  ll r = 1;
  while (r < LONG_LONG_MAX / 100) {
    vector<ll> res;
    for (ll i = 1; i * i <= r; i++) {
      if (r % i == 0) {
        res.push_back(i);
        if (r / i != i)
          res.push_back(r / i);
      }
    }
    sort(res.begin(), res.end());
    for (ll i : res)
      cout << i << " ";
    cout << endl;
    r = r * 10 + 1;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  //    helper();
  E();
  return 0;
}