[C++][STL] Lower Bound-STL

https://www.hackerrank.com/challenges/cpp-lower-bound/problem

 

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


int main() {
    int n, q, y, temp;
    cin >> n;
    vector<int> arr;
    for (int i = 0; i < n; i++) {
        cin >> temp;
        arr.push_back(temp);
    }
    //sort(arr.begin(), arr.end());

    cin >> q;
    vector<int>::iterator low;
    vector<int>::iterator iter;
    iter = arr.begin();
    for (int i = 0; i < q; i++) {
        cin >> y;
        low = lower_bound(arr.begin(), arr.end(), y);
        if (y == arr[low - iter]) cout << "Yes " << (low - iter + 1) << endl;
        else cout << "No " << (low - iter + 1) << endl;
    }
    
    return 0;
}

 

Reference

http://www.cplusplus.com/reference/algorithm/lower_bound/