Heap

Problem by oml1111

#	Likes	Tech tags	Title	Creator	Created date
1	0		Using the STL priority_queue	oml1111	2022-07-31 03:21
2	0		Raw, Commented Implementation	oml1111	2022-10-31 00:50

Using the STL priority_queue | C++ |

By oml1111 |

0 likes

A heap class from the C++ Standard Template Library providing \(O(\log n)\) insertion and \(O(\log n)\) deletion.

#include <queue>

int main() {
    std::priority_queue<int> heap;
    heap.push(5);
    int max_element = heap.top();
    heap.pop();
}

Implement a max-heap data structure. Insert an element into it, then fetch the maximum element, then delete said maximum element.

Cookie	Details
consentGiven	Remembers your cookie consent settings
csrftoken	Protects against cross-site request forgery attacks
default-language	Allows you to set the language of the samples you want to see when browsing problems
default-tech	Allows you to set the technology of the samples you want to see when browsing problems
mixed	Chooses whether unverified categories are ordered by their set order, or after verified categories
sessionid	Tracks your login session
unverified-visible	Allows you to see unverified categories