Find X-Sum of All K-Long Subarrays I

For each k-length sliding window of nums, compute the "x-sum" defined as the sum of elements whose values are among the top x most frequent in that window (ties broken by larger value), and return these sums for all windows. The core challenge is maintaining frequency counts per window and selecting the top-x values by (frequency, value) ordering.