Two arrays of integers are given, each already sorted in non-decreasing order. Print the array obtained by merging the two arrays so that the result is also sorted in non-decreasing order.
The required algorithm is the two-pointer merge: compare the current elements of the two arrays and place the smaller one into the result, advancing the corresponding index.
The program reads from standard input, in this order: - a natural number `n`, followed by `n` integers representing the first array, sorted in non-decreasing order; - a natural number `m`, followed by `m` integers representing the second array, sorted in non-decreasing order. - `1 <= n, m <= 1000` - values are integers in the range `[-1000000, 1000000]` - the input arrays are already sorted in non-decreasing order (not necessarily strictly) - when both arrays contain equal values, the one from array `a` comes first
The program prints to standard output, on a single line, the `n + m` values resulting from the merge, separated by a single space, followed by a newline.
5 1 3 5 7 9 4 2 4 6 8
1 2 3 4 5 6 7 8 9
Use the Get Hint button in the action bar to reveal a guided hint.
No comments yet. Be the first to start the discussion!
5 1 3 5 7 9 4 2 4 6 8
1 2 3 4 5 6 7 8 9
Community solutions unlock after you submit a passing solution. Don't peek.
Create a free account to write code, submit solutions, and track your progress.
