Yes. It looks something like this:

from heapq import *

class Solution:
  # Time: O(klogk) | Space: O(d)
  def findMaximumDistinctElements(self, nums, k):
    distinctElementsCount = 0

    minHeap = []
    counts = {}
    for num in nums:
      counts[nu...