Leha and Function

2000ms

262144K

Description:

Leha like all kinds of strange things. Recently he liked the function F(n, k). Consider all possible k-element subsets of the set [1, 2, ..., n]. For subset find minimal element in it. F(n, k) — mathematical expectation of the minimal element among all k-element subsets.

But only function does not interest him. He wants to do interesting things with it. Mom brought him two arrays A and B, each consists of m integers. For all i, j such that 1 ≤ i, j ≤ m the condition A_i ≥ B_j holds. Help Leha rearrange the numbers in the array A so that the sum $\text{[math]}$ is maximally possible, where A' is already rearranged array.

Input:

First line of input data contains single integer m (1 ≤ m ≤ 2·10⁵) — length of arrays A and B.

Next line contains m integers a₁, a₂, ..., a_m (1 ≤ a_i ≤ 10⁹) — array A.

Next line contains m integers b₁, b₂, ..., b_m (1 ≤ b_i ≤ 10⁹) — array B.

Output:

Output m integers a'₁, a'₂, ..., a'_m — array A' which is permutation of the array A.

Sample Input:

5
7 3 5 3 4
2 1 3 2 3

Sample Output:

4 7 3 5 3

Sample Input:

7
4 6 5 8 8 2 6
2 1 2 2 1 1 2

Sample Output:

2 6 4 5 8 8 6

Informação

Provedor Codeforces

Código CF840A