题解 | #有序序列合并#

import java.util.*;


// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int []arr1 = new int[n];
        int []arr2 = new int[m];
        int []arr3 = new int[m + n];

        for (int i = 0; i < n; i++) {
            arr1[i] = sc.nextInt();
        }
        for (int j = 0; j < m; j++) {
            arr2[j] = sc.nextInt();
        }

        for (int k = 0; k < m + n; k++) {
            // 0-n 个数之前,把arr1存储到arr3中
            if (k < n) {
                arr3[k] = arr1[k];
            } else {
                // n-m 个数之后,把arr2存储到arr3中
                // 注意索引是k-n开始
                arr3[k] = arr2[k - n];
            }
        }

        //调用Arrays.sort()方法对数组进行升序排序
        Arrays.sort(arr3);
        //遍历输出即可
        for (int i = 0 ; i < arr3.length; i++) {
            System.out.print(arr3[i] + " ");
        }


    }
}