AGGRCOW - Aggressive cows


Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at positions x1 ... xN (0 <= xi <= 1,000,000,000).

His C (2 <= C <= N) cows don't like this barn layout and become aggressive towards each other once put into a stall. To prevent the cows from hurting each other, FJ wants to assign the cows to the stalls, such that the minimum distance between any two of them is as large as possible. What is the largest minimum distance?

Input

t – the number of test cases, then t test cases follows.
* Line 1: Two space-separated integers: N and C
* Lines 2..N+1: Line i+1 contains an integer stall location, xi

Output

For each test case output one integer: the largest minimum distance.

Example

Input:

1
5 3
1
2
8
4
9

Output:

3

Output details:

FJ can put his 3 cows in the stalls at positions 1, 4 and 8,
resulting in a minimum distance of 3.


hide comments
tarunvyshnav90: 2023-07-08 17:27:46

wowwwwwwwwwww

trifun: 2023-06-15 00:30:15

Maximum minimum distance.
Gonna ***

datxaban: 2023-04-28 13:50:41

why 1 4 and 8 but not 1 4 and 9?

momen_186: 2023-03-13 22:26:20

@geek_abhi because the farest distance is between 0 and n-1

chiragchhabria: 2022-10-25 12:22:06

i have solved the problem in IDE but unable to submit it due to compilation error can someone help

codertoon: 2022-10-18 07:28:35

@kissu007 - your first True in predicate is smallest minimum distance.

killers_k9: 2022-10-16 15:39:35

Nice question based on Binary search !! still thinking lol :(

mars_coder: 2022-10-09 18:15:51

an educational problem in binary search category :)

Last edit: 2022-10-09 18:18:40
kissu007: 2021-12-04 19:39:46

Could anybody let me know what if we have to look for smallest minimum distance?

mohit_010: 2021-11-11 12:18:51

I suck

Last edit: 2021-11-12 03:13:33

Added by:Roman Sol
Date:2005-02-16
Time limit:2s
Source limit:10000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:USACO February 2005 Gold Division