全RE求助

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