std::sort + std::lower_bound

class Person{
private:
    string name_;
    string adress_;
    long phone_;

void search_name(string name){
        std::sort(pV.begin(),pV.end(),compare_name);
        vector<Person>::iterator i=lower_bound(pV.begin(),pV.end(),Person(name,"",0));
        cout<<*i<<endl;
        }

bool compare_name(Person& obj1,Person& obj2){
    return obj1.get_name()<obj2.get_name();
}

    void search_name(string name){
        std::sort(pV.begin(),pV.end(),compare_name);
        //print(pV);
        pair<vector<Person>::iterator,vector<Person>::iterator> i=equal_range(pV.begin(),pV.end(),Person(name,"",0));
        if(i.first==i.second)
            cout<<*(i.first)<<endl;
    }

#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
int main ()
{
  vector<int> v;
  v.push_back(1);
  v.push_back(2);
  v.push_back(3);
  v.push_back(5);
  v.push_back(6);
 
  vector<int>::iterator l = std::lower_bound(v.begin(), v.end(), 4);
  vector<int>::iterator u = std::upper_bound(v.begin(), v.end(), 4);
 
  std::cout << *l << std::endl;
  std::cout << *u << std::endl;
 
  return 0;
}

    bool Person::operator<(const Person &obj)const{
        return this->name_<obj.name_;
    }

    void search_name(string name){
        std::sort(pV.begin(),pV.end(),compare_name);
        vector<Person>::iterator i=std::lower_bound(pV.begin(),pV.end(),Person(name,"",0));
        vector<Person>::iterator j=std::upper_bound(pV.begin(),pV.end(),Person(name,"",0));
        cout<<*i<<endl;
        cout<<*j<<endl;
    }

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
 
using namespace std;
 
int main ()
{
  typedef vector<string> Vector;
  typedef Vector::iterator Iterator;
 
  Vector v;
  v.push_back("aa");
  v.push_back("bb");
  v.push_back("cc");
  v.push_back("ee");
  v.push_back("ff");
 
  Iterator l = lower_bound(v.begin(), v.end(), string("cc"));
  Iterator u = upper_bound(v.begin(), v.end(), string("cc"));
 
  cout << *l << endl; // печатает сс
  cout << *u << endl; // печатает ee
 
  return 0;
}

#include <iostream>
#include <set>
#include <algorithm>
 
int main()
{
    std::set<int> s{ 1, 2, 3, 4, 5, 6, 0 };
    auto it = s.find(0);
    std::cout << std::distance(s.begin(), it) << '\n';
    it = s.find(3);
    std::cout << std::distance(s.begin(), it) << '\n';
}