题目描述

include[HTML_REMOVED]

using namespace std;
const int N=100000;
int n,m;
int q[N];

int main()
{
scanf(“%d%d”,&n,&m);
for(int i=0;i[HTML_REMOVED]>1;
if(q[mid]>=x)
{
right=mid;
}
else
{
left=mid+1;
}
}
if(q[left]!=x)
{
cout<<”-1 -1”<[HTML_REMOVED]>1;
if(q[mid]<=x)
{
left=mid;
}
else
{
right=mid-1;
}
}
cout<<left<<endl;
}
}
return 0;
}