3318. Find X-Sum of All K-Long Subarrays I

Given an array nums, window length k, and a number x. The X-sum of a window = the sum of elements belonging to the x most frequent values in the window (ties broken by the larger value); each such…