VERY EASY AND SORT CODE
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>>& nums, int w) {\n        sort(nums.begin(),nums.end());\n        long long  cnt=0;\n       // int i=0;\n        long long  temp=nums[0][0];\n        for(int i=1; i<nums.size(); i++){\n            if((nums[i][0]-temp)<=w){\n                continue;\n\n            }\n            else{\n                cnt++;\n                temp=nums[i][0];\n}\n}\n        return cnt+1;\n    }\n};\n```
['C++']