1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

//Lower Bound-STL in C++ - Hacker Rank Solution
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() 
{
   /* Enter your code here. Read input from STDIN. Print output to STDOUT */ 
   /* Lower Bound-STL in C++ - Hacker Rank Solution START */  
   int m, n, num, i, val;
   cin >>m;
   vector <int> v(m);
   for(i = 0; i < m; i++)
       cin >> v[i];
   cin>>n;
   for(i = 0; i < n; i++)
   {
       cin >> val;
       vector <int>::iterator low = lower_bound(v.begin(), v.end(), val);
       if (v[low - v.begin()] == val)
       {
           cout << "Yes " << (low - v.begin() + 1) << endl;
       }
       else
       {
           cout << "No " << (low - v.begin() + 1) << endl;
       }
   }
   /* Lower Bound-STL in C++ - Hacker Rank Solution END */
 return 0;
}