# Relative Sorting

Posted: 21 Dec, 2020
Difficulty: Moderate

## PROBLEM STATEMENT

#### For example

``````Consider the arrays as ARR = { 9, 5, 8, 4, 6, 5 } and BRR = { 8, 4, 5 }
The output for the above example  is { 8, 4, 5, 5, 6, 9 }.
``````

#### Note:

``````Elements of ‘BRR’ are non repeating.
``````
##### Input Format:
``````The first line contains an integer 'T' which denotes the number of test cases or queries to be run. Then, the ‘T’ test cases follow.

The first line of each test case or query contains two single-space separated integers 'N' and ‘M’ representing the size of the ‘ARR’ and ‘BRR’ respectively.

The second line contains 'N' single space-separated integers, representing the elements of array ‘ARR’.

The third line contains 'M' single space-separated integers, representing the elements of array ‘BRR’.
``````
##### Output format:
``````For each test case, print ‘N’ single space-separated integers, representing the elements of ‘ARR’ after the required sorting order in a single line.

Print the output of each test case in a separate line.
``````
##### Note:
``````You do not need to print anything, it has already been taken care of. Just implement the given function.
``````
##### Constraints:
``````1 <= T <= 5
1 <= N <= 10 ^ 5
1 <= M <= 10 ^ 5
(-10 ^ 9) <= ARR[i] , BRR[i]  <= (10 ^ 9)

Time limit: 1 sec
`````` Approach 1
1. The idea is to maintain a visited array of size N.
2. Now, look for all occurrences of BRR elements one by one in ARR and mark them as visited and add them in ans array.
3. After performing the above operation. Insert all unvisited elements of ARR into a set, if any. So that they get arranged in a sorted manner.
4. And then finally insert elements of the set into our RES array.