Codeforces

A. Leha and Function

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的期望最大化

解题思路：观察样例……得出B小对应A大，所以两个排序就可以了……其实就是使得期望最大，贪心的去选就好了。

#include <iostream>#include <stdio.h>#include <stdlib.h>#include <algorithm>#include <string.h>#include <math.h>#include <vector>#include <set>#include <map>#include <queue>#include <stack>#define ll long longusing namespace std;int a[200005];struct point{    int num;    int i;}b[200005];bool cmp(point a,point b){    return a.num>b.num;}int ans[200005];int main(){    int n;    scanf("%d",&n);    for(int i=0;i<n;i++)        scanf("%d",&a[i]);    for(int i=0;i<n;i++){        b[i].i=i;        scanf("%d",&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++)        printf("%d ",ans[i]);    return 0;}