Highest possible sum less than number of elements

Given sorted arrays a1 and a2. find i,j such that. a1[i]+a2[j] <= n [ Number of elements] and their sum is highest possible.