C++ using std::sort, too 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    bool asteroidsDestroyed(long mass, vector<int>& asteroids) {\n        std::sort(asteroids.begin(), asteroids.end());\n\n        for (const int amass : asteroids) {\n            if (mass < amass) {\n                return false;\n            }\n            mass += amass;\n        }\n\n        return true;\n    }\n};\n```
['C++']