提交时间:2023-07-16 18:03:06

运行 ID: 23803

#include"bits/stdc++.h" using namespace std; int n,s[100000],m,x; int sd1(int x){ int l=1,r=n-1; while(l<r){ int mid=l+r>>1; if(s[mid]>=x)r=mid; else l=mid+1;} return s[l];} int sd2(int x){ int l=1,r=n-1; while(l<r){ int mid=l+r+1>>1; if(s[mid]<=x)l=mid; else r=mid-1;} return s[l];} int main(){ cin>>n; for(int i=1;i<=n;i++)cin>>s[i]; cin>>m; while(m--){ cin>>x; if(abs(sd1(x)-x)>abs(sd2(x)-x))cout<<sd2(x)<<endl; else cout<<sd1(x)<<endl; } }