simple solution 100% beat
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        \n        int cnt = 0;\n        int pos = 0;\n        for(int i=1;i<points.size();i++){\n            int x = points[i][0]-points[pos][0];\n            if(x>w){\n                cnt++;\n                pos = i;\n            }\n        }\n        return cnt+1;\n    }\n};\n```
['C++']