_3318.java

packagecom.fishercoder.solutions.fourththousand;

importjava.util.HashMap;
importjava.util.Map;
importjava.util.PriorityQueue;

publicclass_3318 {
publicstaticclassSolution1 {
publicint[] findXSum(int[] nums, intk, intx) {
PriorityQueue<int[]> maxHeap =
newPriorityQueue<>(
 (a, b) ->
a[1] != b[1]
 ? b[1] - a[1]
 : b[0] - a[0]); // a[0] is the number itself, a[1]
// is the frequency
Map<Integer, int[]> map = newHashMap<>();
inti = 0;
for (; i < k; i++) {
int[] a = map.getOrDefault(nums[i], newint[2]);
a[0] = nums[i];
a[1]++;
map.put(nums[i], a);
 }
maxHeap.addAll(map.values());
int[] ans = newint[nums.length - k + 1];
for (intj = i - 1, p = 0; j < nums.length; ) {
ans[p++] = computeTopX(newPriorityQueue<>(maxHeap), x);

j++;
if (j >= nums.length) {
break;
 }
int[] a = map.getOrDefault(nums[j], newint[2]);
a[0] = nums[j];
a[1]++;
map.put(nums[j], a);

a = map.getOrDefault(nums[j - k], newint[2]);
a[0] = nums[j - k];
a[1]--;
map.put(nums[j - k], a);

maxHeap.clear();
maxHeap.addAll(map.values());
 }
returnans;
 }

privateintcomputeTopX(PriorityQueue<int[]> maxHeap, intx) {
intsum = 0;
while (!maxHeap.isEmpty() && x-- > 0) {
int[] a = maxHeap.poll();
sum += a[0] * a[1];
 }
returnsum;
 }
 }
}