Implement a Priority Queue Without Using Built-in Functions.
HardProblem Statement
Implement a Priority Queue Without Using Built-in Functions.
Sample Input
Enqueue(5) -> Enqueue(1) -> Dequeue()
Sample Output
120
Limits
Time: 2s · Memory: 256 MB
Implement a Priority Queue Without Using Built-in Functions.
Enqueue(5) -> Enqueue(1) -> Dequeue()
120
Time: 2s · Memory: 256 MB