Problem Statement

Drone Delivery System Problem Description A logistics startup is planning to launch drone deliveries and needs to work out the required infrastructure. There are 'n' delivery routes running along a straight highway, each starting at a kilometre marker given in the array locations[0,...,n-1]. Every route is served by its own drone. To keep the fleet running smoothly, the company wants to install charging stations along the highway. Each station can recharge any drone within a fixed radius r (in kilometres) of its position. The company can build at most k charging stations, placed anywhere along the highway. Your task is to find the smallest possible integer radius r for which every delivery route lies within range of some 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[]` of length `n`, representing the kilometer markers of routes on the highway. Output A