Pagini recente » Cod sursa (job #1128876) | Cod sursa (job #1087514) | Cod sursa (job #2951845) | Cod sursa (job #1360145) | Cod sursa (job #880045)
Cod sursa(job #880045)
#include<fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int n, m, v[100001], x, i, st, dr, mij, ok, j, p, b, p1, p2, p3, w[100001], u[100001];
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
f>>m;
for(i=1;i<=m;i++)
{
f>>u[i];
f>>w[i];
}
for(i=1;i<=m;i++)
{
p1=-1;
p2=-1;
p3=-1;
if(u[i]%3==0)
{
for(j=1;j<=n;j++)
{
if(v[j]==w[i])p1=j;
}
g<<p1<<'\n';
}
else if(u[i]%3==1)
{
for(j=1;j<=n;j++)
{
if(v[j]<=w[i])p2=j;
}
g<<p2<<'\n';
}
else
{
for(j=1;j<=n&&p3==-1;j++)
{
if(v[j]>=w[i])p3=j;
}
g<<p3;
}
}
f.close();
g.close();
return 0;
}