3321. Find X-Sum of All K-Long Subarrays II

Same as version I (X-sum of length-k windows: the sum of contributions of the x most frequent values, larger value wins ties), but n is large — you need incremental sliding recomputation instead of…