Leetcode 2528. Maximize the Minimum Powered City

Given an array of existing power stations where each station powers cities within radius r and k extra stations can be placed anywhere, maximize the minimum total power any city receives. With n up to 1e5 and k up to 1e9, this is typically solved by binary-searching the target minimum power and using a sliding-window/greedy (difference-array) feasibility check to see if k stations suffice.