 Minimum Difference among K
##### Submissions: 1108   Accuracy: 33.54%   Difficulty: Basic   Marks: 1

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.

Input:
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[].​

Output:
Print an integer which denotes the minimum difference achieved.

Constraints:
1<=T<=50
1<=n<=1000
1<=a[i]<=100000
1<=k<=1000​

Example:
Input:

2
7 3
10 100 300 200 1000 20 30
10 4
1 2 3 4 10 20 30 40 100 200

Output:
20
3

#### ** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Shashwat Jain
Author: shashwat jain

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.