Implementation of lower_bound() and upper_bound() in List of Pairs in C++

// C++ program to demonstrate lower_bound()
// and upper_bound() in List of Pairs

#include <bits/stdc++.h>
using namespace std;

// Function to implement lower_bound()
void findLowerBound(
    list<pair<int, int> >& list,
    pair<int, int>& p)
{
    // Given iterator points to the
    // lower_bound() of given pair
    auto low = lower_bound(list.begin(),
                           list.end(), p);

    cout << "lower_bound() for {2, 5}"
         << " is at index: {"
         << (*low).first << ", "
         << (*low).second << " }"
         << endl;
}

// Function to implement upper_bound()
void findUpperBound(
    list<pair<int, int> >& list,
    pair<int, int>& p)
{
    // Given iterator points to the
    // upper_bound() of given pair
    auto up = upper_bound(list.begin(),
                          list.end(), p);

    cout << "upper_bound() for {2, 5}"
         << " is at index: {"
         << (*up).first << ", "
         << (*up).second << " }"
         << endl;
}

// Driver Code
int main()
{
    list<pair<int, int> > list;

    // Given sorted List of Pairs
    list.push_back(make_pair(1, 3));
    list.push_back(make_pair(1, 7));
    list.push_back(make_pair(2, 4));
    list.push_back(make_pair(2, 5));
    list.push_back(make_pair(3, 8));
    list.push_back(make_pair(8, 6));

    // Given pair {2, 5}
    pair<int, int> p = { 2, 5 };

    // Function Call to find lower_bound
    // of pair p in arr
    findLowerBound(list, p);

    // Function Call to find upper_bound
    // of pair p in arr
    findUpperBound(list, p);

    return 0;
}