Simple 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 countGoodRectangles(vector<vector<int>>& rectangles) {\n        int count = 0;\n        vector<int> ans;\n        \n        for(int i=0; i<rectangles.size(); i++){\n            if(rectangles[i][0] > rectangles[i][1]){\n                ans.push_back(rectangles[i][1]);\n            }\n            else{\n                 ans.push_back(rectangles[i][0]);\n            }\n        }\n\n        int n = ans.size();\n        int max = INT_MIN;\n        for(int i=0 ; i<n; i++){\n            if(ans[i] > max){\n                max = ans[i];\n            }\n        }\n\n        for(int i=0 ; i<n; i++){\n            if(ans[i] == max){\n                count++;\n            }\n        }\n\n        return count;\n\n    }\n};\n```
['C++']