Online Programming Server
Problem 1092: Merge
| Problem ID | 1092 |
|---|---|
| Title | Merge |
| Description | Consider the following problem: you have two sorted-list, and you want to merge them into a single sorted-list. Of course, you can combine them and use sorting algorithms. But there is a simpler way!
|
| Input | The first line contains two integers, N1 and N2, the length of two lists. (1 ≤ N1 , N2 ≤ 100000) The second line contains N1 integers, the first list. The second line contains N2 integers, the second list. Every integers in the list is in the range of 0 to 109, inclusively. The lists are sorted. |
| Output | Output the merged list in a single line. |
| Sample Input | 4 5 1 3 8 8 2 4 5 7 9 |
| Sample Output | 1 2 3 4 5 7 8 8 9 |
| Hint | |
| Last Modified | 2012-05-30 13:53:53 |
| Time Limit | 1 seconds |
| Memory Limit | 64 MB |
| Accepted Solutions | 1 |
| Submitted Solutions | 1 |
| Difficulty Factor | 130 |
Facebook