How to Sort a Vector of Pairs in C Based on the Second Element?

Sorting a Vector of Pairs Based on the Second Element

In C , we can encounter situations where we need to sort a vector of pairs based on the second element. Let's explore how to achieve this effortlessly using the provided information.

The provided vector of pairs, vec, holds pairs of integers and we want to sort it in ascending order based on the second element of each pair. Without resorting to custom function objects, let's leverage the standard template library (STL) and std::less to do the job.

Using C 14 Lambdas

The easiest solution in C 14 leverages lambdas with parameter type inference:

std::sort(vec.begin(), vec.end(), [](auto &left, auto &right) {
    return left.second <p>This anonymous lambda captures the left and right pairs and returns true if the second element of left is less than that of right, effectively sorting the vector in ascending order.</p><h3 id="Using-Custom-Comparators">Using Custom Comparators</h3><p>If lambdas are not an option, we can define a custom comparator to handle the sorting:</p><pre class="brush:php;toolbar:false">struct sort_pred {
    bool operator()(const std::pair<int int> &left, const std::pair<int int> &right) {
        return left.second <p>The sort_pred struct implements the comparison operator, comparing the second elements of the two pairs and returning true if the left pair's element is less than the right.</p>
<h3 id="Using-a-Template-Comparator">Using a Template Comparator</h3>
<p>To generalize the comparator and reuse it for sorting, we can create a template:</p>
<pre class="brush:php;toolbar:false">template <class t1 class t2 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);
    }
};</t1></t1></class>

With this template, we can now sort using:

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

By providing the template arguments, we specify the types of the pair elements and can even customize the comparison using a different predicate like std::greater for descending order.

The above is the detailed content of How to Sort a Vector of Pairs in C Based on the Second Element?. For more information, please follow other related articles on the PHP Chinese website!