c++() easy
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 ans = 1, end = points[0][0] + w;\n\n    for(auto &p: points)\n        if(p[0] > end) ++ans, end = p[0] + w;\n    \n    return ans;\n  }\n};\n```
['C++']