代码：

#include <bits/stdc++.h>
#define ll long long

using namespace std;
const int E=1e6+5;
ll n,m,cz;
ll arr[E];
ll search(ll left,ll right,ll a){
	ll sum=abs(arr[0]-a),j=0;
	while(left<=right){
		ll mid=(left+right)/2;
		if((abs(arr[mid]-a))<sum){
			sum=abs(arr[mid]-a);
			j=mid;
			right=mid-1;
		}
		else{
			left=mid+1;
		}
	}
	return arr[j];
}
int main(){
	cin >>n;
	for(int i=0;i<n;i++){
		cin >>arr[i];
	}
	cin >>m;
	for(int i=0;i<m;i++){
		cin >>cz;
		cout <<search(1,n-1,cz)<<endl;
	}
	return 0;
}

10pts QWQ