Heap
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```\nimport heapq\nclass Solution:\n    def sortArray(self, nums: List[int]) -> List[int]:\n        heap=[]\n        final=[]\n        for i in range(len(nums)):\n            heapq.heappush(heap,nums[i])\n        while(heap):\n            a=heapq.heappop(heap)\n            final.append(a)\n        return(final)\n\n\n```
['Heap (Priority Queue)', 'Python3']