Set of Vectors in C++ STL with Examples

Priority Queue of Vectors in C++ STL with Examples

Last Updated : 17 Mar, 2020

Priority Queue in STL Priority queues are a type of container adapters, specifically designed such that the first element of the queue is the greatest of all elements in the queue and elements are in non increasing order(hence we can see that each element of the queue has a priority{fixed order})

Vector in STL Vector is same as dynamic arrays with the ability to resize itself automatically when an element is inserted or deleted, with their storage being handled automatically by the container. Vector elements are placed in contiguous storage so that they can be accessed and traversed using iterators.

Priority Queue of Vectors in STL: Priority Queue of Vectors can be very efficient in designing complex data structures.

Syntax:

priority_queue<vector<datatype>> pq;

For example: Consider a simple problem where we have to print the maximum vector that is in the queue.

// C++ program to demonstrate 
// use of priority queue for vectors 
  
#include <bits/stdc++.h> 
using namespace std; 
  
priority_queue<vector<int> > pq; 
  
// Prints maximum vector 
void Print_Maximum_Vector(vector<int> Vec) 
{ 
    for (int i = 0; i < Vec.size(); i++) { 
        cout << Vec[i] << " "; 
    } 
    cout << endl; 
    return; 
} 
  
// Driver code 
int main() 
{ 
    // Initializing some vectors 
    vector<int> data_1{ 10, 20, 30, 40 }; 
    vector<int> data_2{ 10, 20, 35, 40 }; 
    vector<int> data_3{ 30, 25, 10, 50 }; 
    vector<int> data_4{ 20, 10, 30, 40 }; 
    vector<int> data_5{ 5, 10, 30, 40 }; 
  
    // Inserting vectors into priority queue 
    pq.push(data_1); 
    pq.push(data_2); 
  
    // printing the maximum vector till now 
    Print_Maximum_Vector(pq.top()); 
  
    // Inserting vectors into priority queue 
    pq.push(data_3); 
  
    // printing the maximum vector till now 
    Print_Maximum_Vector(pq.top()); 
  
    // Inserting vectors into priority queue 
    pq.push(data_4); 
    pq.push(data_5); 
  
    // printing the maximum vector till now 
    Print_Maximum_Vector(pq.top()); 
  
    return 0; 
} 

Output:

10 20 35 40 
30 25 10 50 
30 25 10 50

Set of Vectors in C++ STL with Examples

H

harshit23

Improve

Article Tags :

Practice Tags :

Queue

Similar Reads

Set of Vectors in C++ STL with Examples

Set in STL Sets are a type of associative containers in which each element has to be unique, because the value of the element identifies it. The value of the element cannot be modified once it is added to the set, though it is possible to remove and add the modified value of that element. Vector in

How to Create a Stack of Priority_Queue in C++?

In C++, std::stack is a container that follows the LIFO (Last In, First Out) rule, whereas std::priority_queue is a type of queue in which the first element is either the greatest(by default) or the smallest of all elements in the queue. In this article, we will learn how to create a stack of a prio

Vector of Maps in C++ with Examples

Map in STL: Maps are associative containers that store elements in a mapped fashion. Each element has a key value and a mapped value. No two mapped values can have same key values. Vector in STL: Vector is the same as dynamic arrays with the ability to resize itself automatically when an element is

How to Implement Priority Queue Using Multimap in C++?

A priority queue is a type of queue where elements are removed from the queue based on some priority. The element with the highest (or lowest priority depending on the type) will be removed first. Priority queues are fundamental data structures and are used in many applications like CPU scheduling,

How to Create Vectors of Unique Pointers in C++?

In C++, the vector is defined as a dynamic array that can grow or shrink in size. Vectors of unique pointers are commonly used to manage the collections of dynamically allocated objects as they combine the dynamic resizing capability of vectors with the automatic memory management provided by unique

How to Use Iterator with a Vector in C++?

In C++, vectors are the same as dynamic arrays with the ability to resize themselves automatically when an element is inserted or deleted. An iterator is a pointer-like object that can be used to access elements of a container (like an array or a vector). In this article, we will learn how to use an

Default value of Vector in C++ STL

Vectors are the same as dynamic arrays with the ability to resize itself automatically when an element is inserted or deleted, with their storage being handled automatically by the container. Vector elements are placed in contiguous storage so that they can be accessed and traversed using iterators.

How to Initialize a Vector with Default Values in C++?

Initialization is the process of assigning the value to the elements of vector. In this article, we will learn how to initialize the vector with default value in C++. The simplest method to initialize the vector with default value is by using constructor during declaration. Letâ€™s take a look at a si

How to Create a Vector of Vectors of Pairs in C++?

In C++ STL, we can nest different containers into each other at any number of levels. On such container is the Vector of Vectors of Pairs i.e. 2D vector of pairs. In this article, we will learn how to create and traverse a vector of vector of pairs in C++ STL. Vector of Vectors of Pairs in C++ The 2

How to Create a Vector of Pairs in C++?

In C++, std::pair is the data type that stores the data as keys and values. On the other hand, std::vector is an STL container that stores the collection of data of similar type in the contiguous memory location. In this article, we will learn how to combine these two to create a vector of pairs in