#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll binarySearch(ll a[],ll n,ll m){
ll start=0;
ll end=n-1;
while(start<=end){
ll mid=(start+(end-start))/2;
if(a[mid]==m){
return mid;
}
else if(a[mid]>m){
end=mid-1;
}
else{
start=mid+1;
}
}
return -1;
}
int main() {
ll n,m;
cin>>n;
ll a[n];
for(ll i=0;i<n;i++){
cin>>a[i];
}
sort(a,a+n);
cin>>m;
ll result=binarySearch(a,n,m);
cout<<result<<endl;
return 0;
}
this is my program ,I need to know why I am getting TLE in this program ,how to overcome that problem
