二分查找

#include <bits/stdc++.h>

using namespace std;
int res[101000]; /// 数组开大
int n;

/*
** 递归实现
*/
int QuickSort(int key, int left, int right)
{
    if(left > right)
    {
        return -1;
    }
    int mid = (left+right)/2;
    if(res[mid] == key)
    {
        return mid;
    }
    else if(key < res[mid])
    {
        return QuickSort(key, left, mid-1);
    }
    else
    {
        return QuickSort(key, mid+1, right); /// mid + 1
    }
}
int main()
{
    ios::sync_with_stdio(false);
    int m;
    while(cin >> n >> m)
    {
        for(int i = 0; i < n; i++)
        {
            cin >> res[i];
        }

        while(m--)
        {
            int key;
            cin >> key;
            key = QuickSort(key, 0, n-1);
            cout << key << endl;
        }

    }
    return 0;
}