Try with Heap | Simple 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:\n    def maxProduct(self, nums: List[int]) -> int:\n        heap = []\n        for num in nums:\n            heapq.heappush(heap, -num)\n        max_val = -heapq.heappop(heap)\n        second_max_val = -heapq.heappop(heap)\n        return (max_val-1) * (second_max_val-1)\n```
['Python3']