Do i need here some well known idea?

Problems and Contests
#1

given array a and b
find two indexes i and j so that a[i] > a[j], b[i] > b[j] and i - j is minimal

#2

What are the constraints?

#3

size <= 10^5

#4

Can you give a judge link or anything of the sort?