代码如下 请dalao指点

#include<bits/stdc++.h>
using namespace std;
int a[1000005];
int n , m;
int find(int x)
{
	int l = 1 , r = n , mid;
	while(l <= r)
	{
		mid = (l + r) / 2;
		if(a[mid] <= x)
			l = mid + 1;
		else
			r = mid - 1;
	}
	if(a[1] == x)
		return l;
	else
		return -1;
}
int main()
{
	cin >> n >> m;
	for(int i = 1;i <= n;i++)
		cin >> a[i];
	int y;
	for(int i = 1;i <= n;i++)
	{
		cin >> y;
		cout << find(y) << endl;
	}
	return 0;
}

祝各位dalaoRP++