C++ simple solution
\nint maxProduct(vector<int>& nums) {\n\tpriority_queue<int> pq(nums.begin(), nums.end());\n\tint first = pq.top();\n\tpq.pop();\n\tint second = pq.top();\n\tre
```\nint maxProduct(vector<int>& nums) {\n\tpriority_queue<int> pq(nums.begin(), nums.end());\n\tint first = pq.top();\n\tpq.pop();\n\tint second = pq.top();\n\treturn (first - 1) * (second - 1);\n}\n```\n
['C', 'C++']