Minimum Cost to Connect All Points

You are given an array `points` representing integer coordinates of some points on a 2D-plane, where `points[i] = [xi, yi]`. The cost of connecting two points `[xi, yi]` and `[xj, yj]` is the Manhattan distance between them: `|xi - xj| + |yi - yj|`. Return the minimum cost to make all points connected. ### Constraints - `1 <= points.length <= 1000` - `-10^6 <= xi, yi <= 10^6` ### Input Format Each line contains two space-separated integers representing `xi yi`. ### Output Format Print the minimum cost to connect all points.