sorry for my bad english :<<↵
↵
Given an array F of size n (n<=1e5) and a fixed k (k<=n-2). Perform the deletion of k elements, then arrange the elements in ascending order, calling W is the greatest minus between two consecutive elements.↵
↵
Find the smallest W↵
↵
input ↵
↵
5 1↵
↵
4 1 2 3 9↵
↵
output ↵
↵
1↵
↵
↵
↵
UPDATE: Solution founded↵
↵
https://www.geeksforgeeks.org/minimize-the-maximum-difference-between-adjacent-elements-in-an-array/
↵
Given an array F of size n (n<=1e5) and a fixed k (k<=n-2). Perform the deletion of k elements, then arrange the elements in ascending order, calling W is the greatest minus between two consecutive elements.↵
↵
Find the smallest W↵
↵
input ↵
↵
5 1↵
↵
4 1 2 3 9↵
↵
output ↵
↵
1↵
↵
↵
↵
UPDATE: Solution founded↵
↵
https://www.geeksforgeeks.org/minimize-the-maximum-difference-between-adjacent-elements-in-an-array/