add 2530

Author: fishercoder1534

README.md

@@ -8,8 +8,14 @@ _If you like this project, please leave me a star._ ★
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
+<<<<<<< Updated upstream
 | 2515 |[Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2515.java)                                                                     |[:tv:](https://youtu.be/yTpRd3yvyz0)| Easy                                                                          ||
 | 2520 |[Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2520.java)                                                                     |[:tv:](https://youtu.be/7SHHsS5kPJ8)| Easy                                                                          ||
+=======
+| 2530 |[Maximal Score After Applying K Operations](https://leetcode.com/problems/maximal-score-after-applying-k-operations/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2530.java)                                                                      || Medium                                                                        |
+| 2515 |[Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2515.java)                                                                     || Easy                                                                          ||
+| 2520 |[Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2520.java)                                                                     | [:tv:](https://youtu.be/7SHHsS5kPJ8)                                          | Easy                                                                          ||
+>>>>>>> Stashed changes
 | 2496 |[Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2496.java)                                                                     || Easy                                                                          ||
 | 2467 |[Convert the Temperature](https://leetcode.com/problems/convert-the-temperature/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2469.java)                                                                     || Easy                                                                          ||
 | 2455 |[Average Value of Even Numbers That Are Divisible by Three](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2455.java)                                                                     || Easy                                                                          ||

src/main/java/com/fishercoder/solutions/_2530.java

@@ -0,0 +1,21 @@
+package com.fishercoder.solutions;
+
+import java.util.PriorityQueue;
+
+public class _2530 {
+    public static class Solution1 {
+        public long maxKelements(int[] nums, int k) {
+            long ans = 0L;
+            PriorityQueue<Integer> maxHeap = new PriorityQueue<>((a, b) -> b - a);
+            for (int num : nums) {
+                maxHeap.offer(num);
+            }
+            while (k-- > 0) {
+                int max = maxHeap.poll();
+                ans += max;
+                maxHeap.offer((int) Math.ceil((double) max / 3));
+            }
+            return ans;
+        }
+    }
+}