Problem p02598 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define Rep(i, a, b) for (ll i = a; i < b; ++i)
#define rep(i, b) Rep(i, 0, b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;

constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右下左上 4~7までは斜め
constexpr int dx[] = {1, 0, -1, 0, 1, -1};
constexpr int dy[] = {0, 1, 0, -1, 1, 1};

namespace {
template <typename T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

// 標準出力
void Write(long long x, const char *end = "\\n") { std::cout << x << end; }
template <typename T> void Write(const T &x, const char *end = "\\n") {
  std::cout << x << end;
}
template <typename T, typename U>
void Write(const T &x, const U &y, const char *end = "\\n") {
  std::cout << x << " " << y << end;
}
template <typename T, typename U, typename V>
void Write(const T &x, const U &y, const V &z, const char *end = "\\n") {
  std::cout << x << " " << y << " " << z << end;
}
// template <typename... Args> void Write(Args const&... args) { bool a = true;
// for (auto const& x : { args... }) { if (a) a = false; else std::cout << " ";
// std::cout << x; } std::cout << "\\n"; }
template <typename T>
void Write(const std::vector<T> &x, const char *sep = " ",
           const char *end = "\\n") {
  for (std::size_t i = 0, sz = x.size(); i < sz; ++i) {
    std::cout << x[i] << (i == sz - 1 ? end : sep);
  }
}
template <typename T>
void Write(const std::vector<std::vector<T>> &x, const char *sep = " ",
           const char *end = "\\n") {
  for (auto v : x)
    Write(v, sep, end);
}

// 標準入力
struct Read {
  std::size_t szi, szj;
  Read(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
  template <typename T> operator T() const {
    T a;
    std::cin >> a;
    return a;
  }
  template <typename T> operator std::vector<T>() const {
    std::vector<T> a(szi);
    for (std::size_t i = 0; i < szi; ++i)
      std::cin >> a[i];
    return a;
  }
  template <typename T> operator std::vector<std::vector<T>>() const {
    std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
    for (std::size_t i = 0; i < szi; ++i)
      for (std::size_t j = 0; j < szj; ++j)
        cin >> a[i][j];
    return a;
  }
  template <typename T, typename U>
  operator std::vector<std::pair<T, U>>() const {
    std::vector<std::pair<T, U>> a(szi);
    for (std::size_t i = 0; i < szi; ++i)
      std::cin >> a[i].first >> a[i].second;
    return a;
  }
};
struct Reads {
  template <typename T> Reads(T &a) { std::cin >> a; }
  template <typename T, typename U> Reads(T &a, U &b) { std::cin >> a >> b; }
  template <typename T, typename U, typename V> Reads(T &a, U &b, V &c) {
    std::cin >> a >> b >> c;
  }
  template <typename T, typename U, typename V, typename W>
  Reads(T &a, U &b, V &c, W &d) {
    std::cin >> a >> b >> c >> d;
  }
};

Read read;
} // namespace

int main() {

  int n, k;
  Reads(n, k);
  vector<int> a = Read(n);

  // それぞれの丸太を何分割するか決める？

  // 分割する回数は単純増加
  // 貪欲で良い

  int left = 0;
  int right = 1e9 + 1;
  while (right - left > 1) {
    int mid = (left + right) / 2;
    // Write(mid, left, right);
    int cnt = 0;
    rep(i, n) { cnt += (a[i] - 1) / mid; }
    if (cnt <= k)
      right = mid;
    else
      left = mid;
  }

  Write(right);

  return 0;
}


Error: TLE

Fixed submission:

#include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define Rep(i, a, b) for (ll i = a; i < b; ++i)
#define rep(i, b) Rep(i, 0, b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;

constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右下左上 4~7までは斜め
constexpr int dx[] = {1, 0, -1, 0, 1, -1};
constexpr int dy[] = {0, 1, 0, -1, 1, 1};

namespace {
template <typename T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

// 標準出力
void Write(long long x, const char *end = "\\n") { std::cout << x << end; }
template <typename T> void Write(const T &x, const char *end = "\\n") {
  std::cout << x << end;
}
template <typename T, typename U>
void Write(const T &x, const U &y, const char *end = "\\n") {
  std::cout << x << " " << y << end;
}
template <typename T, typename U, typename V>
void Write(const T &x, const U &y, const V &z, const char *end = "\\n") {
  std::cout << x << " " << y << " " << z << end;
}
// template <typename... Args> void Write(Args const&... args) { bool a = true;
// for (auto const& x : { args... }) { if (a) a = false; else std::cout << " ";
// std::cout << x; } std::cout << "\\n"; }
template <typename T>
void Write(const std::vector<T> &x, const char *sep = " ",
           const char *end = "\\n") {
  for (std::size_t i = 0, sz = x.size(); i < sz; ++i) {
    std::cout << x[i] << (i == sz - 1 ? end : sep);
  }
}
template <typename T>
void Write(const std::vector<std::vector<T>> &x, const char *sep = " ",
           const char *end = "\\n") {
  for (auto v : x)
    Write(v, sep, end);
}

// 標準入力
struct Read {
  std::size_t szi, szj;
  Read(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
  template <typename T> operator T() const {
    T a;
    std::cin >> a;
    return a;
  }
  template <typename T> operator std::vector<T>() const {
    std::vector<T> a(szi);
    for (std::size_t i = 0; i < szi; ++i)
      std::cin >> a[i];
    return a;
  }
  template <typename T> operator std::vector<std::vector<T>>() const {
    std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
    for (std::size_t i = 0; i < szi; ++i)
      for (std::size_t j = 0; j < szj; ++j)
        cin >> a[i][j];
    return a;
  }
  template <typename T, typename U>
  operator std::vector<std::pair<T, U>>() const {
    std::vector<std::pair<T, U>> a(szi);
    for (std::size_t i = 0; i < szi; ++i)
      std::cin >> a[i].first >> a[i].second;
    return a;
  }
};
struct Reads {
  template <typename T> Reads(T &a) { std::cin >> a; }
  template <typename T, typename U> Reads(T &a, U &b) { std::cin >> a >> b; }
  template <typename T, typename U, typename V> Reads(T &a, U &b, V &c) {
    std::cin >> a >> b >> c;
  }
  template <typename T, typename U, typename V, typename W>
  Reads(T &a, U &b, V &c, W &d) {
    std::cin >> a >> b >> c >> d;
  }
};

Read read;
} // namespace

int main() {

  int n, k;
  Reads(n, k);
  vector<int> a = Read(n);

  // それぞれの丸太を何分割するか決める？

  // 分割する回数は単純増加
  // 貪欲で良い

  auto compare = [](pair<int, int> &lhs, pair<int, int> &rhs) {
    ll left = (ll)lhs.first * rhs.second;
    ll right = (ll)rhs.first * lhs.second;
    return left < right;
  };

  priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(compare)> pq{
      compare};

  for (auto v : a)
    pq.emplace(v, 1);

  rep(i, k) {
    auto [v, cnt] = pq.top();
    pq.pop();
    pq.emplace(v, cnt + 1);
  }

  auto [v, cnt] = pq.top();
  int ans = v / cnt;
  if (v % cnt != 0)
    ++ans;

  Write(ans);

  return 0;
}