Codeforces 840A Leha and Function

A. Leha and Function

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 mintegers. For all i, j such that 1 ≤ i, j ≤ m the condition Ai ≥ Bj holds. Help Leha rearrange the numbers in the array A so that the sum  is maximally possible, where A' is already rearranged array.

Input

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

Next line contains m integers a1, a2, ..., am (1 ≤ ai ≤ 109) — array A.

Next line contains m integers b1, b2, ..., bm (1 ≤ bi ≤ 109) — array B.

Output

Output m integers a'1, a'2, ..., a'm — array A' which is permutation of the array A.

Examples

input

57 3 5 3 42 1 3 2 3

output

4 7 3 5 3

input

74 6 5 8 8 2 62 1 2 2 1 1 2

output

2 6 4 5 8 8 6

题意：给定两个数列A，B，A的最小的数大于等于B的最大的数。然后有个函数，F(n,k)，就是求从[1,2,3...n]中取k个元素形成一个子集，然后求所有k个元素组成的子集中最小的元素的数学期望。任务是MAX 求和F(A[i], B[i])

     题解：本来以为是要求递推式，真去求出数学期望，然后再取最大值对应A的排列。后来发现一个规律，就是给定一个n ，k越大， F（n,k）是单调递减的（大概是因为，越到后面，越来越多的子集的最小值变成了整个数列的最小值或者次小值）。所以只要将A最大的对应B最小的即可。

    代码如下：

#include <iostream>#include <algorithm>using namespace std;#define N 200005int a[N],ans[N];struct node{int num;int i;}b[N]; int cmp(node a, node b){return a.num > b.num;}int main(){int n;cin >> n;for(int i = 0;i < n; ++i)cin >> a[i];for(int i = 0;i < n; ++i){b[i].i = i;cin >> b[i].num;}sort(a,a+n);sort(b,b+n,cmp);for(int i = 0;i < n; ++i)ans[b[i].i] = a[i];for(int i = 0;i < n; ++i)cout << ans[i] << " ";return 0;}