Assignment $-7($Week $7)-$ Logistic

Company.

You're working as a software engineer at a logistics

company, Ekart, which handles the delivery of

packages across multiple regions. Recently, your

company upgraded its tracking system to merge

delivery data from two different regions. Each region

keeps track of the packages in a sorted list based on

their tracking IDs.

Due to a recent merger of regional operations, you

need to combine the delivery tracking data from both

regions into a single, sorted list of tracking IDs. This

new list should maintain the sorted order so that

further processing can be done efficiently.

Your task is to write a program that merges two sorted

lists of tracking IDs from these regions into one single

sorted list. The tracking IDs in each list are unique and

sorted in ascending order.

Input Format:

The first line contains an integer $(m),$ the number of

tracking IDs in the first region.

The second line contains $m$ integers representing the

sorted tracking IDs from the first region.

The third line contains an integer $(n),$ the number of

tracking IDs in the second region.

The fourth line contains n integers representing the

sorted tracking IDs from the second region.

Output Format: Output a single line containing the

merged sorted list of tracking IDs.

Sample Test Case:

$\{\begin{array}{c}\text{:}m=5\end{array}$

$n=4$

$secondRegion=[102203304406]$

Sample Output: $[101102203205304305402406$

$501]$

Test Result

Fail

$0$ test$($s$)$ passed out of $1$ test$($s$)$

Test Case $-1$

Faill

Input

$5$

$101205305402501$

$4$

$102203304406$

Your Output

$101,102203205,304305402406501$ in cpp program