不用简化照样过

#include<bits/stdc++.h>
using namespace std;
int n,m;
const int N = 1e6+5; 
int a[N];
int main(){
    cin >> n >> m;
    for(int i=1;i<=n;i++)cin >> a[i];
    while(m--){
        int q;cin >> q;
        int x = lower_bound(a+1,a+n+1,q)-a;
        if(a[x]==q)cout << x<<" ";
        else cout << "-1 ";
    }
}