#include<bits/stdc++.h>
#define ll long long
#define int ll
#define pii pair<int,int>
#define mem(a,b) memset(a,b,sizeof(a))
#define endl '\n'
#define N 100005
const int inf=0x3f3f3f3f;
const double pi=acos(-1.0);
using namespace std;
int a[N];
signed main()
{
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++)
cin>>a[i];
int l=0,r=n;
while(l<r)
{
int mid=(l+r)>>1;
if(a[mid]==k)
{
cout<<mid+1<<endl;
return 0;
}
else if(a[mid]<k) l=mid+1;
else r=mid;
}
cout<<"-1"<<endl;
}
SWUST OJ#640 Binary search
最新推荐文章于 2024-10-13 16:55:28 发布