-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathA.cpp
53 lines (48 loc) · 826 Bytes
/
A.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include<bits/stdc++.h>
#define ll long long
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define db double
#define mp make_pair
#define s second
#define f first
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
int main()
{ quick;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int x[n],b[n];
pair<int,int> xp[n],xpp[n];
fab(0,n,i)
{
cin>>x[i];
xp[i]=mp(x[i],i);
xpp[i]=mp(i,x[i]);
}
fab(0,n,i)
cin>>b[i];
sort(b,b+n);
sort(xp,xp+n);
pair<int,int> ans[n];
fab(0,n,i)
{
ans[xp[i].second]=mp(xp[i].f,b[i]);
}
fab(0,n,i)
cout<<ans[i].f<<" ";
cout<<endl;
fab(0,n,i)
cout<<ans[i].s<<" ";
cout<<endl;
}
return 0;
}