Pagini recente » Cod sursa (job #2455821) | Cod sursa (job #170582) | Cod sursa (job #1005268) | Cod sursa (job #1683756) | Cod sursa (job #1126849)
#include<fstream>
#include<algorithm>
#define nx 100007
using namespace std;
int n,m,i,v[nx],t,x,y;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int main()
{
fin>>n;
for(i=1;i<=n;i++)fin>>v[i];
fin>>m;
for(i=1;i<=m;i++)
{
fin>>t>>x;
if(t==2)
{
y=lower_bound(v+1,v+n+1,x)-v;
}
else
{
y=upper_bound(v+1,v+n+1,x)-v-1;
if(v[y]!=x && !t)y=-1;
}
fout<<y<<'\n';
}
return 0;
}