You have N rectangles (N > 1). The 2N numbers used by the length of short and long edges of these rectangles are all different positive integers.
You can create a larger rectangle by using all of these rectangles. The large rectangle is fully covered without any overlap or overflow of the smaller rectangles. What is the minimum possible area of the large rectangle?
Note: The large rectangle cannot be a square.