#include<bits/stdc++.h> using namespace std; int v[100005]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++)cin>>v[i]; int q,ans=-1; cin>>q; sort(v+1,v+n+1); int l=1,r=n; while(l<=r){ int mid=(l+r)/2; if(v[mid]<q)l=mid+1; else if(v[mid]>q)r=mid-1; else ans=mid; } for(int i=1;i<=n;i++)cout<<v[i]<<" "; cout<<endl; if(ans==-1)cout<<"Not Find"; else cout<<ans; return 0; } TLE玄关求DALAO调