<p>You are given an array of points in the <strong>X-Y</strong> plane <code>points</code> where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code>.</p>

<p>Return <em>the minimum area of a rectangle formed from these points, with sides parallel to the X and Y axes</em>. If there is not any such rectangle, return <code>0</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/08/03/rec1.JPG" style="width: 500px; height: 447px;" />
<pre>
<strong>Input:</strong> points = [[1,1],[1,3],[3,1],[3,3],[2,2]]
<strong>Output:</strong> 4
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/08/03/rec2.JPG" style="width: 500px; height: 477px;" />
<pre>
<strong>Input:</strong> points = [[1,1],[1,3],[3,1],[3,3],[4,1],[4,3]]
<strong>Output:</strong> 2
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= points.length &lt;= 500</code></li>
	<li><code>points[i].length == 2</code></li>
	<li><code>0 &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 4 * 10<sup>4</sup></code></li>
	<li>All the given points are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    bool comp(vector<int> a, vector<int> b) {
        if (a[0]+a[1]==b[0]+b[1]) {
            return a[0]<b[0];
        }
        return (a[0]+a[1]<b[0]+b[1]);
    }
    int minAreaRect(vector<vector<int>>& points) {
        map<int,set<int>> x;
        for (auto point: points) {
            x[point[0]].insert(point[1]);
        }
        int min_area = INT_MAX;
        for (auto i=x.begin(); i!=x.end(); i++) {
            for (auto j=next(i); j!=x.end(); j++) {
                if (i->second.size()>=2 && j->second.size()>=2) {
                    vector<int> y;
                    set_intersection(i->second.begin(),i->second.end(),j->second.begin(),j->second.end(),back_inserter(y));
                    if (y.size()>=2) {
                        for (int k=1; k<y.size(); k++) {
                            min_area = min(min_area, abs(j->first - i->first)*abs(y[k]-y[k-1]));
                        }
                    }
                }
            }
        }
        if (min_area==INT_MAX) {
            return 0;
        }
        return min_area;
    }
};
58396