Minimum Adjacent Swaps for K Consecutive Ones

Given a binary array and an integer k, find the minimum number of adjacent swaps needed to make k ones consecutive by choosing which k ones to gather and minimizing the total distance they must move; this reduces to selecting k one-positions whose distances to their median are minimal and can be computed efficiently using the indices of ones (sliding window + prefix sums).