| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.MaximalScoreAfterApplyingKOperations; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MaximalScoreAfterApplyingKOperationsPriorityQueue : IMaximalScoreAfterApplyingKOperations |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(k log n + n log n), where n is the number of elements in the queue and k is the number o |
| | | 19 | | /// elements |
| | | 20 | | /// Space complexity - O(n + k), where n is the number of elements in the queue and k is the number of new eleme |
| | | 21 | | /// </summary> |
| | | 22 | | /// <param name="nums"></param> |
| | | 23 | | /// <param name="k"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public long MaxKelements(int[] nums, int k) |
| | 2 | 26 | | { |
| | 2 | 27 | | var priorityQueue = new PriorityQueue<int, int>(); |
| | | 28 | | |
| | 26 | 29 | | foreach (var num in nums) |
| | 10 | 30 | | { |
| | 10 | 31 | | priorityQueue.Enqueue(num, -num); |
| | 10 | 32 | | } |
| | | 33 | | |
| | 2 | 34 | | long result = 0; |
| | | 35 | | |
| | 20 | 36 | | for (var i = 0; i < k; i++) |
| | 8 | 37 | | { |
| | 8 | 38 | | var maxElement = priorityQueue.Dequeue(); |
| | | 39 | | |
| | 8 | 40 | | result += maxElement; |
| | | 41 | | |
| | 8 | 42 | | var newElement = (int)Math.Ceiling(maxElement / 3.0); |
| | | 43 | | |
| | 8 | 44 | | priorityQueue.Enqueue(newElement, -newElement); |
| | 8 | 45 | | } |
| | | 46 | | |
| | 2 | 47 | | return result; |
| | 2 | 48 | | } |
| | | 49 | | } |