Merge Two Sorted Arrays [EASY]

Company: Microsoft, Linkedin, Juniper, Goldman-Sachs, Brocade, Amdocs, Zoho, Synopsys, Snapdeal, Quickr

Input:

First line contains an integer T, denoting the number of test cases.
First line of each test case contains two space separated integers X and Y, denoting the size of the two sorted arrays.
Second line of each test case contains X space separated integers, denoting the first sorted array P.
Third line of each test case contains Y space separated integers, denoting the second array Q.

Output:

For each test case, print (X + Y) space separated integer representing the merged array.

Constraints:

1 <= T <= 100
1 <= X, Y <= 5*104
0 <= Pi, Qi <= 109

Example:

INPUT:

1
4 5
7 5 3 1
9 8 6 2 0

OUTPUT:

9 8 7 6 5 3 2 1 0  

CODE:
import java.util.*;
import java.lang.*;
import java.io.*;

class GFG {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
int m = sc.nextInt();
for(int mi=0;mi<m;mi++){
   int n1= sc.nextInt();
   int n2= sc.nextInt();
   /*int []ar1= new int[n1];
   int []ar2= new int [n2];
   for(int i1=0;i1<n1;i1++){
       ar[i1]=sc.nextInt();
   }
   for(int i2=0;i2<n2;i2++){
       ar[i2]=sc.nextInt();
   }*/
   List<Integer> list = new ArrayList<>();
   for(int i=0;i<n1+n2;i++){
       list.add(sc.nextInt());
   }
   Collections.sort(list,Collections.reverseOrder());
   for(int num: list){
       System.out.print(num+" ");
   }
   System.out.println();
}
}

}
EXECUTION TIME: 0.63s (not good, I will try to upload better code inn future )