Ambulance Optimal Route Grid Dispatch

Pune's emergency dispatch center receives multiple accident alerts simultaneously across the city. Given hospital and incident coordinates on a city grid, find the minimum total distance ambulances must travel collectively. Rule: each incident is served by its nearest hospital (Manhattan distance). Return the total distance over all incidents. Your solve(...) function receives the inputs as ready-made arguments — no input reading or parsing needed; just return the answer.

More Arrays problems