Problem title
Difficulty
Avg time to solve

Swap Nodes in Pairs
Moderate
40 mins
Connect MidPoints
Easy
15 mins
Gary and multiplication
Easy
20 mins
Consecutive elements
Moderate
15 mins
Queue Using Stack
Moderate
30 mins
Kth Largest Element In A Stream
Moderate
30 mins
Ways to Arrange Balls
Hard
40 mins
Binary Tree from Parent Array
Easy
15 mins
Diagonal Traversal
Moderate
20 mins
Predecessor And Successor In BST
Easy
10 mins 9

# Chocolate Problem

Difficulty: MEDIUM
Avg. time to solve
15 min
Success Rate
85%

Problem Statement

#### Example :

``````Given 'N' : 5 (number of packets) and 'M' : 3 (number of students)
`````` ``````And chocolates in each packet is : {8, 11, 7, 15, 2}

All possible way to distribute 5 packets of chocolates among 3 students are -

( 8,15, 7 ) difference of maximum-minimum is ‘15 - 7’ = ‘8’
( 8, 15, 2 ) difference of maximum-minimum is ‘15 - 2’ = ‘13’
( 8, 15, 11 ) difference of maximum-minimum is ‘15 - 8’ = ‘7’
( 8, 7, 2 ) difference of maximum-minimum is ‘8 - 2’ = ‘6’
( 8, 7, 11 ) difference of maximum-minimum is ‘11 - 7’ = ‘4’
( 8, 2, 11 ) difference of maximum-minimum is ‘11 - 2’ = ‘9’
( 15, 7, 2 ) difference of maximum-minimum is ‘15 - 2’ = 13’
( 15, 7, 11 ) difference of maximum-minimum is ‘15 - 7’ = ‘8’
( 15, 2, 11 ) difference of maximum-minimum is ‘15 - 2’ = ‘13’
( 7, 2, 11 ) difference of maximum-minimum is ‘11 - 2’ = ‘9’

Hence there are 10 possible ways to distribute ‘5’ packets of chocolate among the ‘3’ students and difference of combination (8, 7, 11) is ‘maximum - minimum’ = ‘11 - 7’ = ‘4’ is minimum in all of the above.
``````
##### Input format :
``````The first line of input contains an integer ‘T’ denoting the number of test cases.
The next ‘2*T’ lines represent the ‘T’ test cases.

The first line of each test case contains two space-separated integers ‘N’ denoting the number of packets of chocolate and ‘M’ denotes the number of students.

The second line of each test case contains ‘N’ space-separated integers denoting the number of chocolate in each of ‘N’ packets.
``````
##### Output Format :
``````For each test case, print the minimum difference of the chocolates contained in the packets distributed to the students.
``````
##### Note :
``````You don't need to print anything, it has already been taken care of. Just implement the given function.
``````
##### Constraints:
``````1 <= T <= 50
2 <= M <= N <= 10^4
1 <= CHOCOLATES[i] <= 10^9

Time Limit : 1 sec
``````
##### Sample Input 1 :
``````2
3 2
7 2 4
4 3
3 5 1 6
``````
##### Sample Output 1 :
``````2
3
``````
##### Explanation For Sample Input 1 :
``````Test Case 1 :

All possible way to distribute 3 packets of chocolate among 2 students are -

( 7, 2 ) difference is ‘7 - 2’ = ‘5’
( 7, 4 ) difference is ‘7 - 4’ = ‘3’
( 2, 4 ) difference is ‘4 - 2’ = ‘2’

There are three ways to distribute 3 packets of chocolate among 2 students but pair ( 4, 2 ) has minimum difference in ‘maximum - minimum’ = ‘4 - 2’ = ‘2’

Test Case 2 :

All possible way to distribute 4 packets of chocolate among 3 students are -

( 3, 5, 1 )  difference is ‘5 - 1’ = ‘4’
( 5, 1, 6 )  difference is ‘6 - 1’ = ‘5’
( 1, 6, 3 )  difference is ‘6 - 1’ = ‘5’
( 6, 5, 3 )  difference is  ‘6 - 3’ = ‘3’

There are four options to choose 3 packets of chocolate. Only ( 6, 5, 3 ) pair has the minimum difference ‘6 - 3’ = ‘3’ comparing other pair of difference ( 4, 5, 5 )
``````
##### Sample Input 2 :
``````2
7 3
7 3 2 4 9 12 56
8 5
3 4 1 9 56 7 9 12
``````
##### Sample Output 2 :
``````2
6
``````   Console