lower bound and upper bound in c 2b 2b

1#include<bits/stdc++.h>
2using namespace std;
3
4int main(){
5    int n;cin>>n;
6    vector<int>v;
7
8    for(int i=0;i<n;i++){
9        cin>>v[i];
10    }
11    sort(v.begin(),v.end());
12
13
14    //lower bound for vector
15    auto pointer1 = lower_bound(v.begin(), v.end(), 7);
16    cout<<(*pointer1)<<endl;
17
18    //lower bound for array;
19    int array[n];
20    for(int i=0;i<n;i++){
21        cin>>array[i];
22    }
23    sort(array,array+n);
24    //lowerbound
25    int *pointer2 = lower_bound(array, array+n, 7);
26
27    //if you want upper bound then just replace lower_bound with upper_bound
28}

1// lower_bound/upper_bound example
2#include <iostream>     // std::cout
3#include <algorithm>    // std::lower_bound, std::upper_bound, std::sort
4#include <vector>       // std::vector
5
6int main () {
7  int myints[] = {10,20,30,30,20,10,10,20};
8  std::vector<int> v(myints,myints+8);           // 10 20 30 30 20 10 10 20
9
10  std::sort (v.begin(), v.end());                // 10 10 10 20 20 20 30 30
11
12  std::vector<int>::iterator low,up;
13  low=std::lower_bound (v.begin(), v.end(), 20); //          ^
14  up= std::upper_bound (v.begin(), v.end(), 20); //                   ^
15
16  std::cout << "lower_bound at position " << (low- v.begin()) << '\n'; 
17  std::cout << "upper_bound at position " << (up - v.begin()) << '\n';
18
19  return 0;
20}
21
22// Output
23// lower_bound at position 3
24// upper_bound at position 6

1// lower_bound/upper_bound example
2#include <iostream>     // std::cout
3#include <algorithm>    // std::lower_bound, std::upper_bound, std::sort
4#include <vector>       // std::vector
5
6int main () {
7  int myints[] = {10,20,30,30,20,10,10,20};
8  std::vector<int> v(myints,myints+8);           // 10 20 30 30 20 10 10 20
9
10  std::sort (v.begin(), v.end());                // 10 10 10 20 20 20 30 30
11
12  std::vector<int>::iterator low,up;
13  low=std::lower_bound (v.begin(), v.end(), 20); //          ^
14  up= std::upper_bound (v.begin(), v.end(), 20); //                   ^
15
16  std::cout << "lower_bound at position " << (low- v.begin()) << '\n';
17  std::cout << "upper_bound at position " << (up - v.begin()) << '\n';
18
19  return 0;
20}

1upper_bound(v.begin(), v.end(), val);
2Returns an iterator pointing to the first element in the range [first,last) which compares greater than val.

1The lower_bound() method in C++ is used to return an iterator pointing to the first element in the range [first, last) which has a value not less than val.