Codeforces Round #429 (Div2) C

C. 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 m integers. 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
5
7 3 5 3 4
2 1 3 2 3
output
4 7 3 5 3
input
7
4 6 5 8 8 2 6
2 1 2 2 1 1 2
output
2 6 4 5 8 8 6

【解题报告】
首先

所以A集合最大对应B集合最小

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define N 200010

struct Data 
{
    int num,id;
    friend bool operator < (const Data &a,const Data &b)
    {return a.num>b.num;}
}b[N];
int m,a[N],ans[N];

int main()
{
    scanf("%d",&m);
    for(int i=1;i<=m;++i) scanf("%d",&a[i]);
    for(int i=1;i<=m;++i)
    {
        scanf("%d",&b[i].num);
        b[i].id=i;
    }
    sort(a+1,a+m+1);
    sort(b+1,b+m+1);
    for(int i=1;i<=m;++i)
    {
        ans[b[i].id]=a[i];
    }
    for(int i=1;i<=m;++i) printf("%d ",ans[i]);
    puts("");
    return 0;
}