Submission #5991151

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <utility>
#include <functional>
#include <bitset>
#include <cstdint>

using namespace std;
using i64 = int64_t;
using i32 = int32_t;
template<class T, class U> void init_n(vector<T>& v, size_t n, U x) 
{ v = vector<T>(n, x); }
template<class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); }
template<class T> void read_n(vector<T>& v, size_t n, size_t o = 0) 
{ v = vector<T>(n+o); for (size_t i=o; i<n+o; ++i) cin >> v[i]; }
template<class T> void read_n(T a[], size_t n, size_t o = 0)
{ for (size_t i=o; i<n+o; ++i) cin >> a[i]; }
template<class T> T gabs(const T& x) { return max(x, -x); }
#define abs gabs

template<class F>
i64 bisect(i64 l, i64 r, F f) { // (l, r]
  if (r - l <= 1) return r;
  i64 m = l + (r - l) / 2;
  return f(m) ? bisect(l, m, f) : bisect(m, r, f);
}

i64 n, k;
vector<i64> w, d;
int main() {
  cin >> n >> k;
  init_n(w, n);
  init_n(d, n);
  for (i64 i = 0; i < n; ++i) {
    cin >> w[i] >> d[i];
  }
  
  i64 ans = bisect(0, 1ll << 62, [&](i64 x) {
    i64 c = 0;
    for (i64 i = 0; i < n; ++i) {
      c += max(i64(0), (x - w[i]) / d[i] + 1);
    }
    return c >= k;
  });

  cout << ans << '\n';
  return 0;
}

Submission Info

Judge Result