Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 4614100
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 22, 20262026-05-22T01:38:57+00:00 2026-05-22T01:38:57+00:00

There is a pair pair <string, int> myPair; I have a vector of myPair

  • 0

There is a pair

pair <string, int> myPair;

I have a vector of myPair objects. I need to convert it to a min-heap using make_heap on the second value of pair i.e. the integer. How can I do that? I am not sure on how to define the comparison operations.

I know I need something like this for heap to operate. But not sure where to put it:

bool operator< (const Pair& p1, const Pair& p2) const 
{ 
    return p1.second < p2.second;
}
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-22T01:38:57+00:00Added an answer on May 22, 2026 at 1:38 am

    Well, make_heap has an overload that takes an extra comparision operator, soo…

    // somewhere in global namespace
    typedef std::pair<std::string, int> myPair_type;
    
    struct mypair_comp{
      bool operator()(myPair_type const& lhs, myPair_type const& rhs){
        return lhs.second < rhs.second;
      }
    };
    
    // somewhere at your callside
    make_heap(first,last,mypair_comp());
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

If I have a vector of pairs: std::vector<std::pair<int, int> > vec; Is there and
I have a variable with a type similar to: map<bool, map<string, pair<string, int> >
On object ValueSet, I have apply(pairs : (String, ValueBase)*) and implicit conversions from Int
I have a pre-existing public/private key pair for RSA encryption which I need to
I have a vector of Key-Value pairs, where each Key-Value pair is also tagged
Is there a good reason why there is no Pair<L,R> in Java? What would
Specifically, when you create an interface/implementor pair, and there is no overriding organizational concern
I have a method that takes a List<int> , which is a list of
I have a list like List<string> TempList = new List<string> { [66,X,X], [67,X,2], [x,x,x]
I'd like to copy values that match a predicate (equal ints) from a map<string,int>

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.