HackerRank Problem Lower Bound-STL

LowerBoundSTL.cpp

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


int main() {
    int n,q;
    vector<int> N;
    cin>>n;
    while(n){
        int val;
        cin>>val;
        N.push_back(val);
        n--;
    }
    cin>>q;
    while(q){
        int query;
        vector<int>::iterator low;
        cin >> query;
        low = lower_bound(N.begin(), N.end(), query);
        if(N[low - N.begin()] == query) {
          cout << "Yes " << (low - N.begin() +1 ) <<endl;
        }else{
            cout<<"No "<<(low - N.begin() +1) <<endl;
        }
        q--;
    }

    return 0;
}