104. Merge Two Sorted Record Lists
Challenge1000 ms256 MBSolved by 0%
Read two lists of records, each already sorted by score in ascending order.
Input ``` n n lines of: name score m m lines of: name score ```
Print all n + m records merged into one ascending list, one per line as name score.
When a record from each list has the same score, print the one from the first list first.
Merge them in a single pass rather than concatenating and sorting.
Constraints - `1 ≤ n, m ≤ 100000` - Names are 1 to 30 letters with no spaces. - `-1000000 ≤ score ≤ 1000000` - Both lists are already sorted ascending.
Input
The first line contains n, then n lines of name score.
The next line contains m, then m lines of name score.
Both lists are already sorted by score.
Output
Print the merged records, one per line as name score, in ascending score order. On a tie the first list's record comes first.
Input2
A 1
B 3
2
C 2
D 4
OutputA 1
C 2
B 3
D 4
Noteinterleaves the two lists evenly
Input2
A 1
B 2
2
C 1
D 2
OutputA 1
C 1
B 2
D 2
Notehas ties across both lists, where the first list must win
Hints
Four rungs, in order. The last two open once you have submitted an attempt. A wrong one counts.
Hint 1Where to start
Hint 2The approachOpen hint 1 first. This one carries on from it.
Hint 3PseudocodeOpen hint 2 first. This one carries on from it.
Hint 4Full solutionOpen hint 3 first. This one carries on from it.