Simple C++ & Python Solution
Approach:\n1. Sort array in increasing order\n2. Start destroying astroid with smallest weight return false if any point it is not possible.\n\n\n\nC++ Solution
**Approach:**\n1. Sort array in increasing order\n2. Start destroying astroid with smallest weight return false if any point it is not possible.\n\n<br>\n\n**C++ Solution :**\n```\nclass Solution\n{\n    public:\n    bool asteroidsDestroyed(int mass, vector<int>& arr)\n    {\n        sort(arr.begin(),arr.end());\n        int n=arr.size();\n        long long m=mass;\n        for (int i=0;i<n;i++)\n        {\n            if (arr[i]<=m)\n                m+=arr[i];\n            else\n                return false;\n        }\n        return true;\n    }\n};\n```\n\n<br>\n\n**Python Solution :**\n```\nclass Solution:\n    def asteroidsDestroyed(self, mass: int, asteroids: List[int]) -> bool:\n        \n        asteroids.sort()\n        \n        for astMass in asteroids:\n            if astMass <= mass:\n                mass += astMass\n            else:\n                return False\n        \n        return True\n```\n**Time Complexity : O(nlogn)**
[]