I was trying to implement some data structures using priority queues just then i found something like

priority_queue< pair < int, int>, vector< pair< int, int> >, greater< pair< int, int> > >p


priority_queue< pair< int,pair< int,int> >,vector< pair< int,pair< int,int> > >,greater< pair< int,pair< int,int> > > > p ;

can someone explain me what does these structures actually do or how do they store the data in them.

and how are they different from simple structures like

priority_queue< pair< int,pair< int,int>>>


no answer yet…??.

Its a min heap containing pairs of <int,int> type. Refer to this for explanation link text .

1 Like

also look to the comment

As I don’t know the answer to your latest post but otherwise really like your blog code chef. All the information you have mentioned on your blog. I have tried to enhance my programming skills. And every post is very informative for me. I learned a lot from your website.