Submission #3010341

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define erep(i, a, b) for (int i = a; i <= (int)(b); ++i)
#define per(i, a, b) for (int i = (b); i > (a); --i)
#define eper(i, a, b) for (int i = ((int)(a)); i >= b; --i)
#define pb push_back
#define mp make_pair
#define INF (1 << 28) - 1
#define MOD 1000000007
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }

int n;
ll k, a[100005], b[100005];
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> k;
  rep(i, 0, n) cin >> a[i];
  rep(i, 0, n) cin >> b[i];
  sort(a, a + n);
  sort(b, b + n);
  ll l = 1LL, r = 1e18L+1;
  while (r - l > 1) {
    ll mid = (r + l) / 2;
    ll cnt = 0;
    rep(i, 0, n) {
      ll tmp = (mid-1) / a[i];
      int itr = upper_bound(b, b+n, tmp) - b;
      cnt += itr;
    }
    if (cnt < k) l = mid;
    else r = mid;
  }
  cout << l << endl;
  return 0;
}

Submission Info

Judge Result