Pagini recente » Istoria paginii utilizator/michael | Diferente pentru utilizator/luluiza intre reviziile 1 si 2 | Cod sursa (job #157141) | Clasament dimineata_dulceata | Cod sursa (job #813330)
Cod sursa(job #813330)
#include<iostream>
#include<cassert>
#include<vector>
#include<algorithm>
#include<math.h>
#include<cstdio>
#include<fstream>
int N,ex,v[100];
using namespace std;
void read()
{
assert(freopen("cautbin.in","r",stdin));
cin>>N;
for(int i=1;i<=N;++i)
cin>>v[i];
cin>>ex;
}
void solve()
{
int x,y;
FILE *g = fopen("cautbin.out","w");
vector<int> A(v,v+N);
vector<int>::iterator low,up;
for(int i = 1 ; i <= ex ; ++i)
{
cin>>x>>y;
if(x==0)
fprintf(g,"%d\n",int(upper_bound(A.begin(),A.end(),y)-A.begin())-1);
if(x==1)
fprintf(g,"%d\n",int(upper_bound(A.begin(),A.end(),y)-A.begin())-1);
if(x==2)
fprintf(g,"%d\n",int(lower_bound(A.begin(),A.end(),y)-A.begin()));
}
fclose(g);
}
int main()
{
read();
solve();
return 0;
}