Find X-Sum of All K-Long Subarrays II

For each k-length sliding window, compute the sum of elements that belong to the x most frequent values in that window (ties broken in favor of larger values). The core challenge is maintaining dynamic frequency counts and efficiently selecting the top-x frequent values as the window slides.