Given two unsorted arrays find the number of pairs where A[i] > X and B[i] > Y

Question

We are given two unsorted arrays. We have to find the number of pairs such that for each pair A[i] > X and B[i] > Y. We will have to process 1 million such queries whe