Angry Cows (Silver)#10595
Bessie the cow has designed what she thinks will be the next big hit video game: "Angry Cows". The premise, which she believes is completely original, is that the player launches cows with a slingshot into a one-dimensional scene consisting of a set of hay bales located at various points on a number line. Each cow lands with enough force to detonate the hay bales in close proximity to her landing site. The goal is to use a set of cows to detonate all the hay bales.
There are hay bales located at distinct integer positions x_1, x_2, \ldots, x_n on the number line. If a cow is launched with power and lands at position , she creates a blast with radius , destroying all hay bales located within the interval [x - r, x + r].
A total of cows are available, and each cow has the same power . Please determine the minimum integer value of such that it is possible to use the cows to detonate every hay bale in the scene.
The first line contains two integers n~(1 \le n \le 50000) and k~(1 \le k \le 10). Each of the next lines contains an integer x_i~(0 \le x_i \le 10^9), specifying the position of one hay bale on the number line.
Print the minimum power with which each cow must be launched in order to detonate all the hay bales.
Example 1