cpp-priority-queue

52 posts

Custom Comparator in Priority_queue in C++ STL

Last Updated: 11 March 2025

Prerequisites:Priority Queue in C++Heap in C++Min Heap and Max HeapPriority_queuetemplate datatype is a very famous STL Container generally ...read more

Technical Scripter

STL

C++

cpp-priority-queue

Technical Scripter 2022

Priority Queue using Binary Heap

Last Updated: 28 March 2025

What is a Priority Queue ?Priority Queue is an extension of the queue with the following properties:Every item has a priority associated wit...read more

Priority queue of pairs in C++ with ordering by first and second element

Last Updated: 01 November 2023

Priority Queue: Priority queue is the extension of the queue in which elements associated with priority and elements having higher priority ...read more

Similar Topics

DSA

22.3k+ articles

Arrays

6.4k+ articles

C++

4k+ articles

C++ Programs

2.5k+ articles

Greedy

2k+ articles

Sorting

1.7k+ articles

STL

1.2k+ articles

Queue

360+ articles

Heap

260+ articles

priority-queue

130+ articles

Priority Queue of Vectors in C++ STL with Examples

Last Updated: 17 March 2020

Priority Queue in STL Priority queues are a type of container adapters, specifically designed such that the first element of the queue is th ...read more

Last Updated: 30 January 2024

Attributes are one of the key features of modern C++ which allows the programmer to specify additional information to the compiler to enforc ...read more

Technical Scripter

C++

Algorithms-Graph Traversals

Volkswagen IT Services

ES6

Android

Intellipaat

K’th Least Element in a Min-Heap

Last Updated: 30 November 2023

Given a min-heap of size n, find the kth least element in the min-heap.Examples:Input : {10, 50, 40, 75, 60, 65, 45} k = 4Output : 50Input : ...read more

Technical Scripter 2018

DSA

Minimum increment/decrement to make array non-Increasing

Last Updated: 16 February 2023

Given an array a, your task is to convert it into a non-increasing form such that we can either increment or decrement the array value by 1 ...read more

priority_queue::top() in C++ STL

Last Updated: 31 July 2022

Priority queues are a type of container adaptors, specifically designed such that the first element of the queue is either the greatest or t ...read more

priority_queue::push() and priority_queue::pop() in C++ STL

Last Updated: 24 October 2024

In C++,priority_queue::push()andpriority_queue::pop()methods are used to insert and delete the element from the priority_queue container. T ...read more

STL

CPP-Library

C++

cpp-containers-library

cpp-queue

cpp-priority-queue

priority_queue::empty() and priority_queue::size() in C++ STL

Last Updated: 01 June 2023

Priority queues are a type of container adaptors, specifically designed such that the first element of the queue is either the greatest or t ...read more

Prim's algorithm using priority_queue in STL

Last Updated: 26 February 2024

Given an undirected, connected and weighted graph, find Minimum Spanning Tree (MST) of the graph using Prim's algorithm.Input : Adjacency Li ...read more

Dijkstra's Shortest Path Algorithm using priority_queue of STL

Last Updated: 23 April 2025

Given a graph and a source vertex in graph, find shortest paths from source to all vertices in the given graph.Input : Source = 0Output : ...read more

How to implement Min Heap using STL?

Last Updated: 10 January 2023

In C++ STL, there is priority_queue that can directly be used to implement Max Heap. In order to fully understand the code, make sure you ar ...read more

STL

C++

cpp-priority-queue

Priority Queue in C++ STL

Last Updated: 19 March 2025

In C++, priority queue is a type of queue in which there is some priority assigned to the elements. According to this priority, elements are ...read more

STL

C++

cpp-containers-library

cpp-priority-queue

Sort a nearly sorted (or K sorted) array

Last Updated: 11 February 2025

Given an array arr[] and a number k . The array is sorted in a way that every element is at max k distance away from it sorted position. It ...read more

1 2 3 4 >>

1 2 3 4 >>

1 2 3 4 >>