Leha and Function CodeForces - 841C （greedy）

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.

Example
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

这题粗略分析，我们观察F函数的性质，首先观察如果n和k的差值越大则这个函数值越大（但是没有证明过），这题是属于构造题，那么想最大则n和最小的k匹配，所有想用贪心试一发，果然是（还是没有证明）。
发现贪心这个标签一直都没有欸~~~

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<queue>
#include<algorithm>
#define INF 0x3f3f3f3f
using namespace std;
struct node
{
    int val,index;
}
b[200005];
int cmp(node x1,node x2)
{
    return x1.val<x2.val;
}
int cmp1(int x,int y)
{
    return x>y;
}
int a[200005];
int ans[200005];
int main()
{
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    for(int i=1;i<=n;i++)
        scanf("%d",&b[i].val),b[i].index=i;
    sort(a+1,a+n+1,cmp1);
    sort(b+1,b+n+1,cmp);
    for(int i=1;i<=n;i++)
        ans[b[i].index]=a[i];
    for(int i=1;i<=n;i++)
        printf("%d ",ans[i]);
    return 0;
}