Skip to content
Related Articles

Related Articles

Improve Article

Queue of Pairs in C++ STL with Examples

  • Difficulty Level : Easy
  • Last Updated : 28 Jul, 2021

Queue in STL are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement where elements are inserted at the back (end) and are deleted from the front. Queue of pair can be very efficient in designing complex data structures. The first element is referenced as ‘first’ and the second element as ‘second’ and the order is fixed (first, second).
Syntax: 
 

Queue<pair<datatype, datatype>> queue_of_pair; 
 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Below are the images to show the working of Queue of Pairs: 
 



 

Below is an example to show the Queue of Pairs:
 

CPP




// C++ program to demonstrate
// the working of STL queue of pairs
 
#include <bits/stdc++.h>
using namespace std;
 
// Print the current pair
void printPair(pair<int, int> p)
{
    // Gives first element from queue pair
    int f = p.first;
 
    // Gives second element from queue pair
    int s = p.second;
 
    cout << "(" << f << ", " << s << ") ";
}
 
// Print the Queue of Pairs
void showQueue(queue<pair<int, int> > gq)
{
    // Print element until the
    // queue is not empty
    while (!gq.empty()) {
        printPair(gq.front());
        gq.pop();
    }
 
    cout << '\n';
}
 
// Driver code
int main()
{
    queue<pair<int, int> > gq;
 
    // Pushing elements inside
    // the queue container
    gq.push({ 10, 20 });
    gq.push({ 15, 5 });
    gq.push({ 1, 5 });
    gq.push({ 5, 10 });
    gq.push({ 7, 9 });
 
    cout << "Queue of Pairs: ";
    showQueue(gq);
 
    // Prints size of queue
    cout
        << "\nSize of Queue of Pairs: "
        << gq.size();
 
    // Prints first element
    // of queue container
    cout << "\nFront of Queue of Pairs: ";
    printPair(gq.front());
 
    // Prints last element
    // of queue container
    cout << "\nBack of Queue of Pairs: ";
    printPair(gq.back());
 
    cout << "\n\nRemoving the Front pair\n";
    gq.pop();
    cout << "Current Queue of Pairs: ";
    showQueue(gq);
 
    return 0;
}
Output: 
Queue of Pairs: (10, 20) (15, 5) (1, 5) (5, 10) (7, 9) 

Size of Queue of Pairs: 5
Front of Queue of Pairs: (10, 20) 
Back of Queue of Pairs: (7, 9) 

Removing the Front pair
Current Queue of Pairs: (15, 5) (1, 5) (5, 10) (7, 9)

 




My Personal Notes arrow_drop_up
Recommended Articles
Page :