Maximum (a[j] - a[i]) * min(b[j], b[i]) such that j > i?

Question

Given two arrays a and b of equal length n having positive integer values, I want an algorithm to find the maximum quantity of (