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

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;

const int MOD = 1e9 + 7; // 998244353;

const int MX = 2e5 + 5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);
const int xd[4] = {1, 0, -1, 0}, yd[4] = {0, 1, 0, -1};

typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

#define mp make_pair
#define f first
#define s second
#define len(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define rep(i, a) FOR(i, 0, a)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define RF0R(i, a) RFOR(i, 0, a)
#define rrep(i, a) RFOR(i, 0, a)
#define trav(a, x) for (auto &a : x)

template <class T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
ll cdiv(ll a, ll b) {
  return a / b + ((a ^ b) > 0 && a % b);
} // divide a by b rounded up
ll fdiv(ll a, ll b) {
  return a / b - ((a ^ b) < 0 && a % b);
} // divide a by b rounded down

template <class T, class U> T fisttrue(T lo, T hi, U f) {
  while (lo + 1 < hi) { // find first index such that f is true
    T mid = (lo + hi) / 2;
    f(mid) ? hi = mid : lo = mid;
  }

  return hi;
}
template <class T, class U> T lstTrue(T lo, T hi, U f) {
  lo--;
  assert(lo <= hi); // assuming f is decreasing
  while (lo < hi) { // find first index such that f is true
    T mid = half(lo + hi + 1);
    f(mid) ? lo = mid : hi = mid - 1;
  }
  return lo;
}
template <class T> void remDup(vector<T> &v) {
  sort(all(v));
  v.erase(unique(all(v)), end(v));
}

// INPUT
template <class A> void re(complex<A> &c);
template <class A, class B> void re(pair<A, B> &p);
template <class A> void re(vector<A> &v);
template <class A, size_t SZ> void re(array<A, SZ> &a);

template <class T> void re(T &x) { cin >> x; }
void re(db &d) {
  str t;
  re(t);
  d = stod(t);
}
void re(ld &d) {
  str t;
  re(t);
  d = stold(t);
}
template <class H, class... T> void re(H &h, T &...t) {
  re(h);
  re(t...);
}

template <class A> void re(complex<A> &c) {
  A a, b;
  re(a, b);
  c = {a, b};
}
template <class A, class B> void re(pair<A, B> &p) { re(p.f, p.s); }
template <class A> void re(vector<A> &x) { trav(a, x) re(a); }
template <class A, size_t SZ> void re(array<A, SZ> &x) { trav(a, x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1, c); }
str ts(const char *s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) {
#ifdef LOCAL
  return b ? "true" : "false";
#else
  return ts((int)b);
#endif
}
template <class A> str ts(complex<A> c) {
  stringstream ss;
  ss << c;
  return ss.str();
}
str ts(vector<bool> v) {
  str res = "";
  F0R(i, len(v)) res += char('0' + v[i]);
  res += "";
  return res;
}
template <size_t SZ> str ts(bitset<SZ> b) {
  str res = "";
  F0R(i, SZ) res += char('0' + b[i]);
  return res;
}
template <class A, class B> str ts(pair<A, B> p);
template <class T> str ts(T v) { // containers with begin(), end()
  bool fst = 1;
  str res = "";
  for (const auto &x : v) {
    if (!fst)
      res += " ";
    fst = 0;
    res += ts(x);
  }
  return res;
}

template <class A, class B> str ts(pair<A, B> p) {
#ifdef LOCAL
  return "(" + ts(p.f) + ", " + ts(p.s) + ")";
#else
  return ts(p.f) + " " + ts(p.s);
#endif
}

// OUTPUT
template <class A> void printl(A x) { cout << ts(x); }
template <class H, class... T> void printl(const H &h, const T &...t) {
  printl(h);
  printl(t...);
}
void print() { printl("\\n"); } // print w/ spaces
template <class H, class... T> void print(const H &h, const T &...t) {
  printl(h);
  if (sizeof...(t))
    printl(" ");
  print(t...);
}

// DEBUG
void DBG() { cerr << " ##" << endl; }
template <class H, class... T> void DBG(H h, T... t) {
  cerr << ts(h);
  if (sizeof...(t))
    cerr << ", ";
  DBG(t...);
}
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
#define printe(...)                                                            \\
  cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: ",            \\
      DBG(__VA_ARGS__)
#define chk(...)                                                               \\
  if (!(__VA_ARGS__))                                                          \\
    cerr << "Line(" << __LINE__ << ") -> function(" << __FUNCTION__            \\
         << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")"                        \\
         << "\\n",                                                              \\
        exit(0);
#else
#define printe(...) 0
#define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(), "r", stdin); }
void setOut(str s) { freopen(s.c_str(), "w", stdout); }
void unsyncIO() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
}
void setIO(str s = "") {
  unsyncIO();
  // cin.exceptions(cin.failbit);
  // throws exception when do smth illegal
  // ex. try to read letter into int
  if (len(s)) {
    setIn(s + ".in"), setOut(s + ".out");
  } // for USACO
}

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

template <typename T> vector<size_t> argsort(vector<T> &v) {
  vector<size_t> idx(v.size());
  iota(idx.begin(), idx.end(), 0);
  sort(idx.begin(), idx.end(),
       [&v](size_t i1, size_t i2) { return v[i1] < v[i2]; });
  return idx;
}
template <typename T> int bisect_left(vector<T> &v, T x) {
  return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T> int bisect_right(vector<T> &v, T x) {
  return upper_bound(v.begin(), v.end(), x) - v.begin();
}

template <typename T> T max(vector<T> &v) { return *max_element(all(v)); }
template <typename T> T min(vector<T> &v) { return *min_element(all(v)); }

template <typename T> map<T, ll> counter(vector<T> &v) {
  map<T, ll> c;
  for (auto &a : v) {
    if (c.find(a) == c.end())
      c[a] = 1;
    else
      c[a] = c[a] + 1;
  }
  return c;
}

template <typename T>
bool erase1(multiset<T> &ms, T x) { // erase only 1 element for multiset
  auto ind = ms.find(x);
  if (ind == ms.end())
    return false;
  ms.erase(ind);
  return true;
}
template <typename T> vector<T> accumulate(vector<T> &v) {
  vector<T> acc(v.size());
  acc[0] = v[0];
  for (int i = 1; i < v.size(); i++)
    acc[i] = acc[i - 1] + v[i];
  return acc;
}
template <typename T> vector<vector<T>> daccumulate(vector<vector<T>> &v) {
  vector<vector<T>> acc(v.size(), vector<T>(v[0].size()));
  for (int i = 0; i < v.size(); i++) {
    for (int j = 0; j < v[0].size(); j++) {
      acc[i][j] += v[i][j];
      if (i)
        acc[i][j] += acc[i - 1][j];
      if (j)
        acc[i][j] += acc[i][j - 1];
      if (i & j)
        acc[i][j] -= acc[i - 1][j - 1];
    }
  }
  return acc;
}

template <typename T> struct edge {
  int src, to;
  T cost;
  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
  edge &operator=(const int &x) {
    to = x;
    return *this;
  }
  operator int() const { return to; }
};

template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;

int K;
int N;
vi A(200'000);
bool f(int l) {
  int cnt = 0;
  rep(i, N) { cnt += (A[i] - 1) / l; }
  return cnt <= K;
}
signed main() {
  setIO();
  // ll N; re(N);
  re(N, K);
  re(A);
  auto result = fisttrue(0, (int)pow(10, 9), f);
  print(result);
}


Error: 0

Fixed submission:

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;

const int MOD = 1e9 + 7; // 998244353;

const int MX = 2e5 + 5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);
const int xd[4] = {1, 0, -1, 0}, yd[4] = {0, 1, 0, -1};

typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

#define mp make_pair
#define f first
#define s second
#define len(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define rep(i, a) FOR(i, 0, a)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define RF0R(i, a) RFOR(i, 0, a)
#define rrep(i, a) RFOR(i, 0, a)
#define trav(a, x) for (auto &a : x)

template <class T> bool ckmin(T &a, const T &b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
constexpr int pct(int x) { return __builtin_popcount(x); }
constexpr int bits(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
ll cdiv(ll a, ll b) {
  return a / b + ((a ^ b) > 0 && a % b);
} // divide a by b rounded up
ll fdiv(ll a, ll b) {
  return a / b - ((a ^ b) < 0 && a % b);
} // divide a by b rounded down
ll half(ll x) { return fdiv(x, 2); }

template <class T, class U> T fstTrue(T lo, T hi, U f) {
  // note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop
  // infinitely when lo=hi
  hi++;
  assert(lo <= hi); // assuming f is increasing
  while (lo < hi) { // find first index such that f is true
    T mid = half(lo + hi);
    f(mid) ? hi = mid : lo = mid + 1;
  }
  return lo;
}
template <class T, class U> T lstTrue(T lo, T hi, U f) {
  lo--;
  assert(lo <= hi); // assuming f is decreasing
  while (lo < hi) { // find first index such that f is true
    T mid = half(lo + hi + 1);
    f(mid) ? lo = mid : hi = mid - 1;
  }
  return lo;
}
template <class T> void remDup(vector<T> &v) {
  sort(all(v));
  v.erase(unique(all(v)), end(v));
}

// INPUT
template <class A> void re(complex<A> &c);
template <class A, class B> void re(pair<A, B> &p);
template <class A> void re(vector<A> &v);
template <class A, size_t SZ> void re(array<A, SZ> &a);

template <class T> void re(T &x) { cin >> x; }
void re(db &d) {
  str t;
  re(t);
  d = stod(t);
}
void re(ld &d) {
  str t;
  re(t);
  d = stold(t);
}
template <class H, class... T> void re(H &h, T &...t) {
  re(h);
  re(t...);
}

template <class A> void re(complex<A> &c) {
  A a, b;
  re(a, b);
  c = {a, b};
}
template <class A, class B> void re(pair<A, B> &p) { re(p.f, p.s); }
template <class A> void re(vector<A> &x) { trav(a, x) re(a); }
template <class A, size_t SZ> void re(array<A, SZ> &x) { trav(a, x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1, c); }
str ts(const char *s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) {
#ifdef LOCAL
  return b ? "true" : "false";
#else
  return ts((int)b);
#endif
}
template <class A> str ts(complex<A> c) {
  stringstream ss;
  ss << c;
  return ss.str();
}
str ts(vector<bool> v) {
  str res = "";
  F0R(i, len(v)) res += char('0' + v[i]);
  res += "";
  return res;
}
template <size_t SZ> str ts(bitset<SZ> b) {
  str res = "";
  F0R(i, SZ) res += char('0' + b[i]);
  return res;
}
template <class A, class B> str ts(pair<A, B> p);
template <class T> str ts(T v) { // containers with begin(), end()
  bool fst = 1;
  str res = "";
  for (const auto &x : v) {
    if (!fst)
      res += " ";
    fst = 0;
    res += ts(x);
  }
  return res;
}

template <class A, class B> str ts(pair<A, B> p) {
#ifdef LOCAL
  return "(" + ts(p.f) + ", " + ts(p.s) + ")";
#else
  return ts(p.f) + " " + ts(p.s);
#endif
}

// OUTPUT
template <class A> void printl(A x) { cout << ts(x); }
template <class H, class... T> void printl(const H &h, const T &...t) {
  printl(h);
  printl(t...);
}
void print() { printl("\\n"); } // print w/ spaces
template <class H, class... T> void print(const H &h, const T &...t) {
  printl(h);
  if (sizeof...(t))
    printl(" ");
  print(t...);
}

// DEBUG
void DBG() { cerr << " ##" << endl; }
template <class H, class... T> void DBG(H h, T... t) {
  cerr << ts(h);
  if (sizeof...(t))
    cerr << ", ";
  DBG(t...);
}
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
#define printe(...)                                                            \\
  cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: ",            \\
      DBG(__VA_ARGS__)
#define chk(...)                                                               \\
  if (!(__VA_ARGS__))                                                          \\
    cerr << "Line(" << __LINE__ << ") -> function(" << __FUNCTION__            \\
         << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")"                        \\
         << "\\n",                                                              \\
        exit(0);
#else
#define printe(...) 0
#define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(), "r", stdin); }
void setOut(str s) { freopen(s.c_str(), "w", stdout); }
void unsyncIO() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
}
void setIO(str s = "") {
  unsyncIO();
  // cin.exceptions(cin.failbit);
  // throws exception when do smth illegal
  // ex. try to read letter into int
  if (len(s)) {
    setIn(s + ".in"), setOut(s + ".out");
  } // for USACO
}

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

template <typename T> vector<size_t> argsort(vector<T> &v) {
  vector<size_t> idx(v.size());
  iota(idx.begin(), idx.end(), 0);
  sort(idx.begin(), idx.end(),
       [&v](size_t i1, size_t i2) { return v[i1] < v[i2]; });
  return idx;
}
template <typename T> int bisect_left(vector<T> &v, T x) {
  return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T> int bisect_right(vector<T> &v, T x) {
  return upper_bound(v.begin(), v.end(), x) - v.begin();
}

template <typename T> T max(vector<T> &v) { return *max_element(all(v)); }
template <typename T> T min(vector<T> &v) { return *min_element(all(v)); }

template <typename T> map<T, ll> counter(vector<T> &v) {
  map<T, ll> c;
  for (auto &a : v) {
    if (c.find(a) == c.end())
      c[a] = 1;
    else
      c[a] = c[a] + 1;
  }
  return c;
}

template <typename T>
bool erase1(multiset<T> &ms, T x) { // erase only 1 element for multiset
  auto ind = ms.find(x);
  if (ind == ms.end())
    return false;
  ms.erase(ind);
  return true;
}
template <typename T> vector<T> accumulate(vector<T> &v) {
  vector<T> acc(v.size());
  acc[0] = v[0];
  for (int i = 1; i < v.size(); i++)
    acc[i] = acc[i - 1] + v[i];
  return acc;
}
template <typename T> vector<vector<T>> daccumulate(vector<vector<T>> &v) {
  vector<vector<T>> acc(v.size(), vector<T>(v[0].size()));
  for (int i = 0; i < v.size(); i++) {
    for (int j = 0; j < v[0].size(); j++) {
      acc[i][j] += v[i][j];
      if (i)
        acc[i][j] += acc[i - 1][j];
      if (j)
        acc[i][j] += acc[i][j - 1];
      if (i & j)
        acc[i][j] -= acc[i - 1][j - 1];
    }
  }
  return acc;
}

template <typename T> struct edge {
  int src, to;
  T cost;
  edge(int to, T cost) : src(-1), to(to), cost(cost) {}
  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
  edge &operator=(const int &x) {
    to = x;
    return *this;
  }
  operator int() const { return to; }
};

template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;

int K;
int N;
vi A(200'000);
bool f(int l) {
  int cnt = 0;
  rep(i, N) { cnt += (A[i] - 1) / l; }
  return cnt <= K;
}
signed main() {
  setIO();
  // ll N; re(N);
  re(N, K);
  re(A);
  auto result = fstTrue(0, (int)pow(10, 9), f);
  print(result);
}