Sorting a vector of pairs [closed]

Answer 1

The operator< is overloaded for pair<int,int> so you can sort a vector of pairs just like any other vector. If you need descending order, you have two options - either sort and then call std::reverse to reverse the result or provide predicate for the sorting.

You can also make use of std::greater:

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    vector<pair<int, int> > a;
    a.push_back(make_pair(1, 2));
    a.push_back(make_pair(2, 3));
    sort(a.begin(), a.end(), greater<pair<int,int> >());
    return 0;
}

Answer 2

use this,

template<class T>
struct sortFunctor: public unary_function<std::pair<int, int>, std::pair<int, int>>
{
    bool operator()(const std::pair<int, int>& First, const std::pair<int, int>& Second)
    {
        if(First.first < Second.first)
        {
            return false;
        }
        if(First.first == Second.first && First.second < Second.second)
        {
            return false;
        }
        return true;
    }
}

then pass this functor as a third parameter to sort function.