1584. Min Cost to Connect All Points

class Solution {
public:
    using int2=pair<int, int>;
    int V;
    int L1(vector<int>& P, vector<int>& Q){
        return abs(P[0]-Q[0])+abs(P[1]-Q[1]);
    }
    int minCostConnectPoints(vector<vector<int>>& points) {
        V=points.size();
        priority_queue<int2, vector<int2>, greater<int2>> pq;
        pq.push({0, 0});
        vector<bool> visited(V, 0);
        int ans = 0;
        int n = 0;
        while (!pq.empty()) {
            auto [w, i] = pq.top();
            pq.pop();
            if (visited[i]) continue; // Skip visited 
            visited[i]=1;
            ans+= w;
            n++;
            if (n == V) return ans;
            for (int j=0; j<V; j++){
                if (visited[j]) continue;
                int&& wt=L1(points[i], points[j]);
                pq.push({wt, j});
            }
        }
        return -1;
    }
};