Given an array of n integers and a positive number k. We are allowed to take any k integers from the given array. The task is to find the minimum possible value of the difference between maximum and minimum of k numbers.
The first line of input contains an integer T denoting the number of test cases. Each test case contains two integers n and k where n denotes the number of elements in the array a. Next line contains space separated n elements in the array a.
Print an integer which denotes the minimum difference achieved.
10 100 300 200 1000 20 30
1 2 3 4 10 20 30 40 100 200
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.