Problem Statement

Drone Delivery System Problem Description Pincode wants to start delivering using drones, and they are assessing the logistics needed for implementing the same. There are 'n' delivery routes along a straight highway. Each route begins at a certain kilometre marker as denoted in the array locations[0,...,n-1]. There would be one drone for each delivery route. To enable the smooth functioning of the entire delivery system and keep the drones operational, Pincode wants to install charging stations along the highway. Each station can only charge drones within a fixed radius r (in kms) from its position. Pincode can build at most k charging stations placed anywhere along the highway. Your task is to determine the minimum possible integer radius r such that all delivery routes are within range of at least one charging station. Input An integer `n` representing the number of delivery routes/drones. An integer `k` representing the number of charging stations available. An array `locations[]` o