20分求条

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll N=1e5+5;
ll a[N],b[N];
ll two(ll n,ll le){
	ll left,right,mid,f=-1,len=le-1;
	left=0;
	right=le-1;
	while(left<=right){
		mid=(left+right)/2;
		if(b[mid]==n){
			f=mid;
			break;
		}
		else if(n<b[mid]){
			right=mid-1;
		}
		else if(n>b[mid]){
			left=mid+1;
		}
	}
	return (f==-1?-1:b[f]);
}
int main(){ 
	ll n,m;
	cin>>n>>m;
	for(ll i=0;i<n;i++){
		cin>>a[i];
	} 
	sort(a,a+n);
	for(ll i=0;i<m;i++){
		cin>>b[i]; 
	} 
	sort(b,b+m);
	for(ll i=0;i<n;i++){
		ll t=two(a[i],n);
		if(t!=-1){
			cout<<t<<" ";
		}
		t=0;
	}
}