hackerrank>Dashboard>C++>STL>Lower Bound-STL

You are given integers in the sorted order. Then you are given queries. In each query you will be given an integer and you have to tell whether that integer is present in the array, if so you have to tell at which index it is present and if it is not present you have to tell the index at which the smallest integer that is just greater than the given number is present.
Lower bound is a function that can be used with a sorted vector. Learn how to use lower bound to solve this problem byClicking Here.

Input Format

The first line of the input contains the number of integers . The next line contains integers in sorted order. The next line contains , the number of queries. Then lines follow each containing a single integer .
If the same number is present multiple times, you have to print the first index at which it occurs.
The input is such that you always have an answer for each query.

Constraints

,whereis element in the array.

Output Format

For each query you have to print "Yes"(without the quotes)if the number is present and at which index(1-based) it is present separated by a space.
If the number is not present you have to print "No"(without the quotes) followed by the index of the next smallest number just greater than that number.
You have to output each query in a new line.

Sample Input

 8 1 1 2 2 6 9 9 15 4 1 4 9 15

Sample Output

 Yes 1 No 5 Yes 6 Yes 8输出最近的最小的大于所给值的下标
#include <cmath>#include <cstdio>#include <vector>#include <iostream>#include <algorithm>#include <map>#define MAX 1e9+8using namespace std;int main(){    int N;    while(~scanf("%d",&N))    {        vector<int>vec1;        while(N--)        {            int t;            scanf("%d",&t);            vec1.push_back(t);        }        cin>>N;        string s[2]={"No","Yes"};        while(N--)        {            int t;            cin>>t;            vector<int>::iterator it;            it=lower_bound(vec1.begin(),vec1.begin()+vec1.size(),t);            cout<<s[*it==t]<<' '<<it-vec1.begin()+1<<endl;        }    }    return 0;}