cswork / OA打开练习工作台

IBMOA #6

Merge Two Sorted Arrays

估计简单可在线判题

考点(AI 标注)双指针滑窗

Merge two non-decreasing arrays into one non-decreasing array, keeping all duplicate elements.

输入格式

The first line contains n, the second line contains the n items of a, and the third line contains the n items of b. The raw text of the same problem supplies the full ranges 2≤n≤100000, 0≤element≤10^9.

输出格式

Output the 2n items after merging.

样例 1

输入:

3
1 3 5
2 4 6

输出:

1 2 3 4 5 6

样例 2

输入:

2
1 1
1 1

输出:

1 1 1 1

样例 3

输入:

2
0 9
0 3

输出:

0 0 3 9

样例说明

The examples give 1 2 3 4 5 6; four 1s; and 0 0 3 9 respectively.