真的要自闭了

#include <bits/stdc++.h>
using namespace std;
#define maxn 1000005
int mid;
int a[maxn];
int n, m;

int find(int b) {
	int l = 1, r = n;
	while (l < r) {
		mid = l + (r - l) / 2;
		if (a[mid] >= b) {
			r = mid;
		} else
			l = mid + 1;
	}
	if (a[l] == b) {
		return 1;
	} 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++) {
		int b;
		cin >> b;
		int ans = find(b);
		cout << ans << " ";
	}
	return 0;
}