Problem:
Score: 500 points

Problem Statement

Takahashi will take part in an eating contest. Teams of N members will compete in this contest, and Takahashi's team consists of N players numbered 1 through N from youngest to oldest. The consumption coefficient of Member i is A_i.

In the contest, N foods numbered 1 through N will be presented, and the difficulty of Food i is F_i. The details of the contest are as follows:

A team should assign one member to each food, and should not assign the same member to multiple foods.

It will take x \times y seconds for a member to finish the food, where x is the consumption coefficient of the member and y is the difficulty of the dish.

The score of a team is the longest time it takes for an individual member to finish the food.

Before the contest, Takahashi's team decided to do some training. In one set of training, a member can reduce his/her consumption coefficient by 1, as long as it does not go below 0. However, for financial reasons, the N members can do at most K sets of training in total.

What is the minimum possible score of the team, achieved by choosing the amounts of members' training and allocating the dishes optimally?

Constraints

All values in input are integers.

1 \leq N \leq 2 \times 10^5

0 \leq K \leq 10^{18}

1 \leq A_i \leq 10^6\ (1 \leq i \leq N)

1 \leq F_i \leq 10^6\ (1 \leq i \leq N)

Input

Input is given from Standard Input in the following format:

N K
A_1 A_2 ... A_N
F_1 F_2 ... F_N

Output

Print the minimum possible score of the team.

Sample Input 1

3 5
4 2 1
2 3 1

Sample Output 1

2

They can achieve the score of 2, as follows:

Member 1 does 4 sets of training and eats Food 2 in (4-4) \times 3 = 0 seconds.

Member 2 does 1 set of training and eats Food 3 in (2-1) \times 1 = 1 second.

Member 3 does 0 sets of training and eats Food 1 in (1-0) \times 2 = 2 seconds.

They cannot achieve a score of less than 2, so the answer is 2.

Sample Input 2

3 8
4 2 1
2 3 1

Sample Output 2

0

They can choose not to do exactly K sets of training.

Sample Input 3

11 14
3 1 4 1 5 9 2 6 5 3 5
8 9 7 9 3 2 3 8 4 6 2

Sample Output 3

12

Solution in Rust (1.42.0) (judge verdict: Accepted)

use std::io;
use std::str::FromStr;
use std::collections::BinaryHeap;
use std::cmp::Ordering;
use std::cmp::max;

#[derive(Eq, PartialEq, Debug)]
struct Cost {
    value: u64,
    difficulty: u64,
}

impl Ord for Cost {
    fn cmp(&self, other: &Cost) -> Ordering {
        other.value.partial_cmp(&self.value).unwrap()
    }
}

impl PartialOrd for Cost {
    fn partial_cmp(&self, other: &Cost) -> Option<Ordering> {
        self.value.partial_cmp(&other.value)
    }
}

fn input_tuple() -> (u64, u64) {
    let mut line: String = String::new();
    io::stdin().read_line(&mut line);
    let vec: Vec<u64> = line.split_whitespace().map(|s| s.parse().unwrap()).collect();
    (vec[0], vec[1])
}

fn input_vec() -> Vec<u64> {
    let mut line: String = String::new();
    io::stdin().read_line(&mut line);
    line.split_whitespace().map(|s| s.parse().unwrap()).collect()
}

fn binary_search<F>(mut ok: i64, mut ng: i64, is_ok: F) -> i64
    where
        F: Fn(i64) -> bool
    {
        while (ok - ng).abs() > 1 {
            let mid = (ok + ng) / 2;
            if is_ok(mid) {
                ok = mid;
            } else {
                ng = mid;
            }
        }
        ok
}

fn main () {
    let (n, k) = input_tuple();
    let mut a_vec = input_vec();
    let mut f_vec = input_vec();

    a_vec.sort();
    f_vec.sort_by(|x, y| y.cmp(&x));
    
    let mut tmp_max = 0;
    for i in 0..n as usize {
        tmp_max = max(a_vec[i] * f_vec[i], tmp_max);
    }

    let ans = binary_search(tmp_max as i64, -1, |x| {
        let mut sum = 0;
        for i in 0..n as usize {
            if a_vec[i] * f_vec[i] > x as u64 {
                sum += a_vec[i] - x as u64 / f_vec[i];
            }
        }
        // println!("{}, {}", x, sum);
        sum <= k 
    });
    println!("{}", ans);
    
}