Very Easy 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)$$ -->\nO(NlogN)\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>& asteroids) {\n        int n=asteroids.size();\n        sort(asteroids.begin(),asteroids.end());\n        long long sum=mass;\n        for(auto& i:asteroids)\n        {\n            if(i<=sum)\n            {\n                sum+=i;\n            }\n            else\n            {\n                return false;\n            }\n        }\nreturn true;\n        \n    }\n};\n```
['Array', 'Greedy', 'Sorting', 'C++']