<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:
    
    class Pair{
        public:
            int dist,node;
            Pair(int dist,int node){
                this->dist = dist;
                this->node = node;
            }

    };
    class cmp{
        public:
            bool operator()(Pair* p1,Pair* p2){
                return p1->dist > p2->dist;
            }
    };
    vector<vector<int>> createGraph(vector<vector<int>>& point){
        int n = point.size();
        vector<vector<int>> graph(n,vector<int>(n,0));
        for(int i = 0; i < n; i++){
            
            for(int j = i + 1; j < n; j++){
                int x= abs(point[i][0] - point[j][0]);
                int y = abs(point[i][1] - point[j][1]);
                graph[i][j] = x+y;
                graph[j][i] = x+y;
            }
        }
        return graph;
    }
    int minCostConnectPoints(vector<vector<int>>& points) {
        vector<vector<int>> graph = createGraph(points);
        int n = points.size();
        vector<int> vis(n,0);
        vector<int> dist(n,INT_MAX);
        int ans = 0;
        priority_queue<Pair*,vector<Pair*>,cmp> queP;
        queP.push(new Pair(0,0));
        int tvis = 1;
        while(!queP.empty() && tvis <= n){
            Pair* p = queP.top();
            queP.pop();
            if(vis[p->node]) continue;
            vis[p->node] = 1;
            tvis++;
            ans+=p->dist;
            cout<<p->node<<" "<<p->dist<<endl;
            int ver = p->node;
            for(int i = 0; i < n; i++){
                if(vis[i] == 0 && i != ver){
                    Pair* p = new Pair(graph[ver][i],i);
                    
                    queP.push(p);
                }
            }

        }
        return ans;
    }
};
119765