Codeforces Round #429 (Div2) C
来源:互联网 发布:淘宝客如何招代理 编辑:程序博客网 时间:2024/05/16 12:44
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 200010struct 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;}
- Codeforces round#429 div2 C
- Codeforces Round #429 (Div2) C
- Codeforces round 181 div2 C
- codeforces div2 round#231 C
- codeforces div2 round#230 C
- Codeforces - Round.313.Div2.C
- codeforces Round #352 div2 C
- Codeforces Round #409 div2 C
- Codeforces Round #429 (Div2) B
- codeforces Round #237(div2) C解题报告
- codeforces Round #241(div2) C解题报告
- codeforces round #257 div2 C、D
- Codeforces Round #262(div2) C. Present
- codeforces Round #269(div2) C解题报告
- codeforces Round #267(div2) C解题报告
- codeforces Round #271(div2) C解题报告
- codeforces Round #272(div2) C解题报告
- codeforces Round #264(div2) C解题报告
- ajax 异步获取导致的错误
- ssm框架的搭建
- Word-docx文件图片信息格式分析
- COBIT信息及相关技术控制目标认证
- php笔记-1
- Codeforces Round #429 (Div2) C
- AD里的app_id概念
- 《机器学习&&深度学习》 视频课程资源百度云下载
- 自学问题总结1:关于JSP导入图片扩展名大小写具有敏感性
- Android3.0以前的Fragment支持(ViewPager)
- CRISC风险及信息系统监控认证
- 使用ssh工具进行服务器资料的上传下载
- SpringMVC详解(二)------详细架构
- onClick、onTouch、onTouchEvent的调用