Anton and Perfectionism#10247
Anton has two arrays, each containing numbers, where is an even number. He needs to create exactly pairs from these arrays, adhering to the following rules:
Each pair consists of one number from the first array and one number from the second array.
The numbers in each pair must be different.
In exactly half of the pairs, the number from the first array should be less than the number from the second array.
Help Anton by finding any valid way to form these pairs.
The first line contains the even integer (2 \leq n \leq 10^5).
The second line lists integers a_1, a_2, \ldots, a_n (1 \leq a_i \leq 10^9), representing the numbers in the first array.
The third line lists integers b_1, b_2, \ldots, b_n (1 \leq b_i \leq 10^9), representing the numbers in the second array.
Output lines, each containing two integers, representing the pairs that meet the conditions.
If multiple solutions exist, you may output any of them.
If no solution is possible, output a single integer .
Example 1
Example 2
In the first test case, the provided solution is not unique.
In the second test case, it is straightforward to verify that forming four pairs that meet the conditions is impossible.