Leetcode 3634. Minimum Removals to Balance Array

Given nums and k, remove the fewest elements so the remaining array has max ≤ k * min. Equivalently, find the largest subset of numbers with max/min ≤ k and return n minus that subset size.