Problem p02598 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define REP(i, x, n) for (ll i = x; i < n; i++)
#define SZ(v) (ll) v.size()
#define endl "\n"
#define ff first
#define ss second
#define PQ_MIN priority_queue<ll, vector<ll>, greater<ll>>
#define PQ priority_queue<int>
#define pbds                                                                   \
  tree<int, null_type, less<int>, rb_tree_tag,                                 \
       tree_order_statistics_node_update>
#define setbit(x) __builtin_popcount(x)
#define prec(n) fixed << setprecision(n)
#define pb(n) push_back(n)
#define mp(a, b) make_pair(a, b)
#define clr(n) memset(n, 0, sizeof(n))
#define reset(n) memset(n, -1, sizeof(n))
#define ii pair<ll, ll>
#define vll vector<ll>
using namespace std;
using namespace __gnu_pbds;
bool comp(pair<ll, ll> a, pair<ll, ll> b) {}
const ll MOD = 1e9 + 7;
void print(vector<vector<ll>> &v) {
  ll n = v.size();
  ll m = v[0].size();
  cout << "\n";
  for (ll i = 0; i < n; i++) {
    for (ll j = 0; j < m; j++)
      cout << v[i][j] << " ";
    cout << "\n";
  }
}
void print(vector<ll> &v) {
  ll n = v.size();
  cout << "\n";
  for (ll i = 0; i < n; i++) {
    cout << v[i] << " ";
  }
  cout << "\n";
}
void print(set<ll> &s) {

  cout << endl;

  set<ll>::iterator it;
  for (it = s.begin(); it != s.end(); it++)
    cout << *it << " ";
  cout << endl;
}
ll __lcm(ll a, ll b) { return ((a * b) / __gcd(a, b)); }
ll power(ll a, ll p) {
  ll res = 1;
  while (p > 0) {
    if (p & 1) {
      res = (res * a) % MOD;
      p--;
    }
    a = (a * a) % MOD;
    p /= 2;
  }

  return res % MOD;
}
const ll INF = 1e16;
const ll nxm = 2e5 + 5;
ll n, k;
ll a[nxm];

bool can(ll hig, ll k) {
  REP(i, 0, n) {
    ll need = a[i] / hig;
    if (a[i] <= hig)
      need = 1;
    else {
      need = a[i] / hig;

      if (a[i] % hig)
        need++;
    }
    k -= (need - 1);

    if (k < 0)
      return false;
  }
  return true;
}

void solve() {
  cin >> n >> k;

  ll maxi = 0;

  REP(i, 0, n) cin >> a[i], maxi = max(maxi, a[i]);

  ll l = 0, r = maxi;

  while (l <= r) {
    ll mid = (l + r) / 2;
    if (can(mid, k)) {

      r = mid - 1;
    } else
      l = mid + 1;
  }

  cout << l << endl;
}
int main() {
  //    freopen("timber_input", "r", stdin);
  //    freopen("output.txt", "w", stdout);
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ll t = 1;
  //	cin>>t;
  REP(i, 1, t + 1) {
    //    cout<<"Case #"<<i<<": ";
    solve();
  }
  return 0;
}
//  bitset<64>(x).to_ullong() // in my com  _ulong()
//  cout<<bitset<64>(ans).to_string().substr(64-m)<<endl;
/*

char s[100];

fgets(s,100,stdin);

stringstream stram(s);

string abc;

bool ok1=0,ok2=0;

while(stram>>abc)
*/


Fixed submission:
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
#define REP(i, x, n) for (ll i = x; i < n; i++)
#define SZ(v) (ll) v.size()
#define endl "\n"
#define ff first
#define ss second
#define PQ_MIN priority_queue<ll, vector<ll>, greater<ll>>
#define PQ priority_queue<int>
#define pbds                                                                   \
  tree<int, null_type, less<int>, rb_tree_tag,                                 \
       tree_order_statistics_node_update>
#define setbit(x) __builtin_popcount(x)
#define prec(n) fixed << setprecision(n)
#define pb(n) push_back(n)
#define mp(a, b) make_pair(a, b)
#define clr(n) memset(n, 0, sizeof(n))
#define reset(n) memset(n, -1, sizeof(n))
#define ii pair<ll, ll>
#define vll vector<ll>
using namespace std;
using namespace __gnu_pbds;
bool comp(pair<ll, ll> a, pair<ll, ll> b) {}
const ll MOD = 1e9 + 7;
void print(vector<vector<ll>> &v) {
  ll n = v.size();
  ll m = v[0].size();
  cout << "\n";
  for (ll i = 0; i < n; i++) {
    for (ll j = 0; j < m; j++)
      cout << v[i][j] << " ";
    cout << "\n";
  }
}
void print(vector<ll> &v) {
  ll n = v.size();
  cout << "\n";
  for (ll i = 0; i < n; i++) {
    cout << v[i] << " ";
  }
  cout << "\n";
}
void print(set<ll> &s) {

  cout << endl;

  set<ll>::iterator it;
  for (it = s.begin(); it != s.end(); it++)
    cout << *it << " ";
  cout << endl;
}
ll __lcm(ll a, ll b) { return ((a * b) / __gcd(a, b)); }
ll power(ll a, ll p) {
  ll res = 1;
  while (p > 0) {
    if (p & 1) {
      res = (res * a) % MOD;
      p--;
    }
    a = (a * a) % MOD;
    p /= 2;
  }

  return res % MOD;
}
const ll INF = 1e16;
const ll nxm = 2e5 + 5;
ll n, k;
ll a[nxm];

bool can(ll hig, ll k) {
  REP(i, 0, n) {
    ll need = a[i] / hig;
    if (a[i] <= hig)
      need = 1;
    else {
      need = a[i] / hig;

      if (a[i] % hig)
        need++;
    }
    k -= (need - 1);

    if (k < 0)
      return false;
  }
  return true;
}

void solve() {
  cin >> n >> k;

  ll maxi = 0;

  REP(i, 0, n) cin >> a[i], maxi = max(maxi, a[i]);

  ll l = 1, r = maxi;

  while (l <= r) {
    ll mid = (l + r) / 2;
    if (can(mid, k)) {

      r = mid - 1;
    } else
      l = mid + 1;
  }

  cout << l << endl;
}
int main() {
  //    freopen("timber_input", "r", stdin);
  //    freopen("output.txt", "w", stdout);
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ll t = 1;
  //	cin>>t;
  REP(i, 1, t + 1) {
    //    cout<<"Case #"<<i<<": ";
    solve();
  }
  return 0;
}
//  bitset<64>(x).to_ullong() // in my com  _ulong()
//  cout<<bitset<64>(ans).to_string().substr(64-m)<<endl;
/*

char s[100];

fgets(s,100,stdin);

stringstream stram(s);

string abc;

bool ok1=0,ok2=0;

while(stram>>abc)
*/