Find the max number of points contained in a rectangle with the given area
<p>Given an array of Points b[0..n-1], each having .x and .y coordinates. n may be large.</p>

<p>Devise an efficient algorithm for problem:Given an area, find the max number of points contained in a rectangle with the given area.</p>

<p>I want it to be done on time complexity O(n^2 *k) where k is max points in rectangle or better.</p>