Data Structured64_q3a_heap_kth

Heap K-th

fed558e7-263a-4a16-97a4-ff2b7a731ae3.cppC++
1// Loading code...

Selected Submission

100 / 100
0.027s
11548 KB
P-QueueHeap
Time Comp.
O(1)
Space Comp.
O(1)
Readability
4/10

"The code implements a custom priority queue and provides a method to retrieve the k-th largest element. The core data structure used is a vector to store the elements of the priority queue, and the algorithm relies on comparisons to maintain the heap property."

History

AttemptPoints Time
Try #210011/2/2024
Try #110011/2/2024