洛谷P2249

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1000000 + 5;
int input[maxn];
int search(int l, int r,int x)
{
	int mid;
	while (l < r)
	{
		mid = (l + r) >> 1;
		if (input[mid] >= x)
		{
			r = mid;
		}
		else
		{
			l = mid + 1;
		}
	}
	return input[l] == x ? l+1 : -1;
}
int main(void)
{
	int n,m;
	scanf("%d%d", &n,&m);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &input[i]);
	}
	while (m--)
	{
		int x;
		scanf("%d", &x);
		printf("%d ", search(0, n-1 , x));
	}
	return 0;
}