C++ solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minRectanglesToCoverPoints(vector<vector<int>>& points, int w) {\n        sort(points.begin(),points.end());\n        int left=0,right=0;\n        int n=points.size();\n        int count=0;\n        while(right<n)\n        {\n\n            while(right<n && points[right][0]<=points[left][0]+w)\n            {\n                right++;\n            }\n            left=right;\n\n            count++;\n        }\n        return count;\n    }\n};\n```
['C++']