Medium

Author: Simcoderan

Med2530.java

@@ -0,0 +1,22 @@
+import java.util.Collections;
+import java.util.PriorityQueue;
+import java.util.Queue;
+
+class Med2530 {
+  public long maxKelements(int[] nums, int k) {
+    long ans = 0;
+    Queue<Integer> maxHeap = new PriorityQueue<>(Collections.reverseOrder());
+
+    for (final int num : nums)
+      maxHeap.offer(num);
+
+    for (int i = 0; i < k; ++i) {
+      final int num = maxHeap.poll();
+      ans += num;
+      maxHeap.offer((num + 2) / 3);
+    }
+
+    return ans;
+  }
+}
+