k large elements [BASIC]

Company: Walmart- Labs, Microsoft, Amazon

Question:

Given an array, print k largest elements from the array.  The output elements should be printed in decreasing order.

Input:

The first line of input contains an integer T denoting the number of test cases.
The first line of each test case is N and k, N is the size of array and K is the largest elements to be returned.
The second line of each test case contains N input C[i].

Output:

Print the k largest element in descending order.

Constraints:

1 ≤ T ≤ 100
1 ≤ N ≤ 100
K ≤ N
1 ≤ C[i] ≤ 1000

Example:

Input:
2
5 2
12 5 787 1 23
7 3
1 23 12 9 30 2 50

Output:
787 23
50 30 23

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 n = sc.nextInt();

    int []ar= new int[n];

    int k=sc.nextInt();

    for(int i=0;i<n;i++){

        ar[i]=sc.nextInt();

    }

    Arrays.sort(ar);

    for(int j=n-1;j>n-1-k;j--){

        System.out.print(ar[j]+" ");

    }

    System.out.println();

}

}

}

EXECUTION TIME: 0.18s