✅✔️Short and Easy 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    bool asteroidsDestroyed(int mass, vector<int>& arr) {\n        sort(arr.begin(),arr.end());\n        long long x = mass;\n        for(int i=0; i<arr.size(); i++){\n            if(arr[i] > x) return false;\n            x += arr[i];\n        }\n        return true;\n    }\n};\n```
['Array', 'Greedy', 'Sorting', 'C++']