Minimum Dual Area

### Read problem statements in [Vietnamese](https://www.codechef.com/download/translated/JUNE21/vietnamese/DAREA.pdf), Given $N$ points in a $2D$ space, find the minimum sum of areas of rectangles required to cover all the points given that we can use at most $2$ non-overlapping rectangles whose sides can touch. The rectangles must be axis-aligned, meaning the sides are vertical and horizontal.