Pagini recente » Cod sursa (job #850418) | Cod sursa (job #2766855) | Borderou de evaluare (job #2203670) | Cod sursa (job #1193618) | Cod sursa (job #1811516)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int a[100100],m,n,x,y;
int main()
{
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
cin >> m;
while(m--)
{
cin >> y >> x;
if (y == 0)
{
y = upper_bound(a+1,a+n+1,x) - (a+1);
if (a[y] == x && y != 1) cout << y << "\n";
else cout << "-1\n";
}
else
{
if (y == 1)cout << upper_bound(a+1,a+n+1,x) - (a+1) << "\n";
else cout << lower_bound(a+1,a+n+1,x) - a<< "\n";
}
}
}