Problem Challenge 3: Frequency Stack (hard)

lets take this case 5,5,5,2,2,2,1,1,1

The output should be 5, 2, 1, 5, 2, 1, 5, 2, 1

initially all are the same but 5 got inserted first so it goes out. if we pop out 5 then we have more 2 and 2 got inserted before 1 then it gets popped out then 1

Here is my solution to the problem.

from heapq import *
import sys

class Element:
  def __init__(self, val, freq, time):
    self.val = val 
    self.freq = freq
    self.time = time
  
  def __lt__(self, other):
    # compare the frequencies first then compare the time
    if self.freq < other.freq:
        return True
    elif self.freq > other.freq:
        return False
    else:
        return self.time < other.time
    
class Solution:
  def __init__(self):
    self.max_heap = []
    self.tracker = {}
    self.time =