Entrepreneur

#include <iostream>

using namespace std;

const int N = 2e5 + 5;

int n, t;
int k[N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> t;
  for (int i = 1; i <= n; i++) {
    cin >> k[i];
  }
  long long lo = 0, hi = 1000000000000000000;
  long long res = -1;
  while (lo <= hi) {
    long long mid = (lo + hi) >> 1;
    long long ans = 0;
    for (int i = 1; i <= n; i++) {
      ans = min(1LL * t, ans + mid / k[i]);
    }
    if (ans >= t) {
      res = mid;
      hi = mid - 1;
    } else {
      lo = mid + 1;
    }
  }
  cout << res << '\n';
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED