코드 블럭 테스트

import java.util.Arrays;
import java.util.Scanner;

public class Main {

    public static int[] solution(int[] arr1, int[] arr2) {
        int[] result = new int[arr1.length + arr2.length];
        int idx = 0, p1 = 0, p2 = 0;

        while (p1 < arr1.length && p2 < arr2.length) {
            if (arr1[p1] > arr2[p2]) {
                result[idx++] = arr2[p2++];
            } else {
                result[idx++] = arr1[p1++];
            }
        }

        while (p1 < arr1.length) {
            result[idx++] = arr1[p1++];
        }

        while (p2 < arr2.length) {
            result[idx++] = arr2[p2++];
        }

        return result;
    }

    // 두 배열 합치기 (두 배열을 합쳐 오름차순으로 정렬)
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);

        int n = in.nextInt();
        int[] arr1 = new int[n];
        for (int i = 0; i < n; i++) {
            arr1[i] = in.nextInt();
        }

        int m = in.nextInt();
        int[] arr2 = new int[m];
        for (int i = 0; i < m; i++) {
            arr2[i] = in.nextInt();
        }

        System.out.println(Arrays.toString(solution(arr1, arr2)));
    }
}

public class Test {
    public static void main(String[] args) {
        String str = "hello world";
        System.out.println(str);
    }
}