Problem of the day
Input: ‘N’ = 3, ‘K’ = 2, 'POSITION' = [2, 3, 6]
Output: 2
There are two possible ways to cover exactly two boxes. One covers the boxes at positions 2 and 3 and the other at positions 3 and 6. The carpet lengths required for both ways are 2 ( Since boxes are at positions 2 and 3 each having width 1) and 4, respectively. So the minimum length of the carpet is 2.
The first line will contain the integer 'T', denoting the number of test cases.
The first line of each test case contains two integers ‘N’ and ‘K’ denoting the length of the array 'POSITION' and the number of boxes to be covered respectively.
The second line of each test case contains ‘N’ integers denoting the position of the boxes.
For each test case, return the minimum length of the carpet to cover any ‘K’ boxes.
You don't need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 10
1 <= N <= 10^5
K > 0
1 <= POSITION[i] <= 10^9
Time Limit: 1 sec
2
4 3
4 9 2 6
2 1
1 2
5
1
For the first case:
There are two possible ways to cover exactly three boxes. One covers the boxes at positions 2, 4 and 6 and the other at positions 4, 6 and 9. The carpet lengths required for both ways are 5 and 6, respectively. So the minimum length of the carpet is 5.
For the second case:
Since we need to cover only one box, the minimum length of the carpet is 1.
2
5 2
100 2 95 145 47
1 1
100
6
1