1import heapq
2import math
3
4def maxScore(nums, k):
5    # Using a max heap by inserting negative values
6    nums = [-num for num in nums]
7    heapq.heapify(nums)
8    score = 0
9
10    for _ in range(k):
11        # Extract maximum element
12        max_elem = -heapq.heappop(nums)
13        # Add to score
14        score += max_elem
15        # Calculate new value after operation
16        new_value = math.ceil(max_elem / 3)
17        # Insert back into heap
18        heapq.heappush(nums, -new_value)
19
20    return score
21
22# Example Usage
23nums = [1,10,3,3,3]
24k = 3
25print(maxScore(nums, k))  # Output: 17

1using System;
2using System.Collections.Generic;
3
4public class MaxScoreClass
5{
    public static int MaxScore(int[] nums, int k)
    {
        // Using PriorityQueue from C# Collections
        var maxHeap = new PriorityQueue<int, int>(Comparer<int>.Create((x, y) => y - x));
        foreach (var num in nums) maxHeap.Enqueue(num, num);
        int score = 0;

        for (int i = 0; i < k; ++i)
        {
            int maxElem = maxHeap.Dequeue();
            score += maxElem;
            maxHeap.Enqueue((int)Math.Ceiling(maxElem / 3.0), (int)Math.Ceiling(maxElem / 3.0));
        }
        return score;
    }

    public static void Main() 
    {
        int[] nums = { 1, 10, 3, 3, 3 };
        int k = 3;
        Console.WriteLine(MaxScore(nums, k)); // Output: 17
    }
}