How do I sort a vector of pairs based on the second element of the pair?

by

EDIT: using c++14, the best solution is very easy to write thanks to lambdas that can now have parameters of type auto. This is my current favorite solution

std::sort(v.begin(), v.end(), [](auto &left, auto &right) {
    return left.second < right.second;
});

ORIGINAL ANSWER:

Just use a custom comparator (it’s an optional 3rd argument to std::sort)

struct sort_pred {
    bool operator()(const std::pair<int,int> &left, const std::pair<int,int> &right) {
        return left.second < right.second;
    }
};

std::sort(v.begin(), v.end(), sort_pred());

If you’re using a C++11 compiler, you can write the same using lambdas:

std::sort(v.begin(), v.end(), [](const std::pair<int,int> &left, const std::pair<int,int> &right) {
    return left.second < right.second;
});

EDIT: in response to your edits to your question, here’s some thoughts …
if you really wanna be creative and be able to reuse this concept a lot, just make a template:

template <class T1, class T2, class Pred = std::less<T2> >
struct sort_pair_second {
    bool operator()(const std::pair<T1,T2>&left, const std::pair<T1,T2>&right) {
        Pred p;
        return p(left.second, right.second);
    }
};

then you can do this too:

std::sort(v.begin(), v.end(), sort_pair_second<int, int>());

or even

std::sort(v.begin(), v.end(), sort_pair_second<int, int, std::greater<int> >());

Though to be honest, this is all a bit overkill, just write the 3 line function and be done with it 😛

More Related Contents:

  1. Concatenating two std::vectors
  2. Nice way to append a vector to itself
  3. C++ valarray vs. vector
  4. Is std::vector copying the objects with a push_back?
  5. vector::at vs. vector::operator[]
  6. Reading and writing a std::vector into a file correctly
  7. Converting between C++ std::vector and C array without copying
  8. How to cheaply assign C-style array to std::vector?
  9. In which scenario do I use a particular STL container?
  10. How do I print out the contents of a vector?
  11. What are the complexity guarantees of the standard containers?
  12. How do I sort a std::vector by the values of a different std::vector?
  13. Floating point keys in std:map
  14. Is the size of std::array defined by standard
  15. Looking for C++ STL-like vector class but using stack storage
  16. Difference between erase and remove
  17. Why is the C++ initializer_list behavior for std::vector and std::array different?
  18. Sorting a vector in descending order
  19. std::map emplace without copying value
  20. C++ Double Address Operator? (&&)
  21. c++ exception : throwing std::string
  22. Why don’t the std::fstream classes take a std::string?
  23. how portable is end iterator decrement?
  24. Template class with template container
  25. Windows Unicode C++ Stream Output Failure
  26. Can raw pointers be used instead of iterators with STL algorithms for containers with linear storage?
  27. STL remove doesn’t work as expected?
  28. std::back_inserter for a std::set?
  29. C++, can I statically initialize a std::map at compile time?
  30. list of polymorphic objects

Leave a Comment