Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.*;
- public class Main7 {
- public static void sortedMerge(int a[], int b[], int res[], int n, int m){
- int i = 0, j = 0, k = 0;
- while (i < n) {
- res[k] = a[i];
- i++;
- k++;
- }
- while (j < m) {
- res[k] = b[j];
- j++;
- k++;
- }
- Arrays.sort(res);
- }
- public static void main(String[] args) {
- Scanner scan = new Scanner(System.in);
- int N = scan.nextInt();
- int M = scan.nextInt();
- System.out.println();
- int arr[] = new int[N];
- for (int a = 0; a < N; a++) {
- arr[a] = scan.nextInt();
- }
- int arr1[] = new int[M];
- for (int b = 0; b < M; b++) {
- arr1[b] = scan.nextInt();
- }
- System.out.println();
- int n = arr.length;
- int m = arr1.length;
- int arr2[]=new int[n + m];
- sortedMerge(arr, arr1, arr2, n, m);
- for (int i = 0; i < n + m; i++)
- System.out.print(arr2[i] + " ");
- }
- }
Add Comment
Please, Sign In to add comment
