<p>You are given an array <code>points</code> representing integer coordinates of some points on a 2D-plane, where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code>.</p>

<p>The cost of connecting two points <code>[x<sub>i</sub>, y<sub>i</sub>]</code> and <code>[x<sub>j</sub>, y<sub>j</sub>]</code> is the <strong>manhattan distance</strong> between them: <code>|x<sub>i</sub> - x<sub>j</sub>| + |y<sub>i</sub> - y<sub>j</sub>|</code>, where <code>|val|</code> denotes the absolute value of <code>val</code>.</p>

<p>Return <em>the minimum cost to make all points connected.</em> All points are connected if there is <strong>exactly one</strong> simple path between any two points.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/26/d.png" style="width: 214px; height: 268px;" />
<pre>
<strong>Input:</strong> points = [[0,0],[2,2],[3,10],[5,2],[7,0]]
<strong>Output:</strong> 20
<strong>Explanation:</strong> 
<img alt="" src="https://assets.leetcode.com/uploads/2020/08/26/c.png" style="width: 214px; height: 268px;" />
We can connect the points as shown above to get the minimum cost of 20.
Notice that there is a unique path between every pair of points.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> points = [[3,12],[-2,5],[-4,1]]
<strong>Output:</strong> 18
</pre>

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

<ul>
	<li><code>1 &lt;= points.length &lt;= 1000</code></li>
	<li><code>-10<sup>6</sup> &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 10<sup>6</sup></code></li>
	<li>All pairs <code>(x<sub>i</sub>, y<sub>i</sub>)</code> are distinct.</li>
</ul>

class Solution {
public:

    int par[1009];
    int sz[1009];
    
    void make(int val){
        par[val]=val;
        sz[val]=1;
        
    }
    
    int find(int val){
        if(par[val]==val)return val;
        return par[val]=find(par[val]);
    }
    
    void Union(int a,int b){
        a=find(a);
        b=find(b);
        
        if(a!=b){
            if(sz[a]<sz[b]){
                swap(a,b);
              
            }
              par[b]=a;
                sz[a]+=sz[b];
        }
            
    }
    
    int dist(int x1,int y1,int x2,int y2){
        return abs(x1-x2)+abs(y1-y2);
    }

    int minCostConnectPoints(vector<vector<int>>& points) {
        multiset<pair<int,pair<int,int>>>ms;
        
        map<pair<int,int>,int>mp;
        for(int i=0;i<points.size();i++){
            mp[{points[i][0],points[i][1]}]=i+1;
        }
        for(int i=0;i<points.size();i++)
        {
            for(int j=i+1;j<points.size();j++){
                ms.insert({dist(points[i][0],points[i][1],points[j][0],points[j][1]),{mp[{points[i][0],points[i][1]}  ],mp[{points[j][0],points[j][1]}  ]}});
            }
        }
        
        
            for(int i=0;i<points.size();i++){
         
                
                make(mp[{points[i][0],points[i][1]}]);
        }
        int ans=0;
        for(auto i: ms){
            int node1=i.second.first;
            int node2=i.second.second;
            int wt=i.first;
            if(find(node1)!=find(node2)){
                Union(node1,node2);
                ans+=wt;
                
            }
        }
        
        return ans;
    }
};
143715