Easy | Multiset | Short and Efficient code
\n\n# Code\n\nclass Solution {\npublic:\n    // use of set\n    int findMaxK(vector<int>& nums) {\n        multiset<int> st;\n        for(auto it : nums)\n     
\n\n# Code\n```\nclass Solution {\npublic:\n    // use of set\n    int findMaxK(vector<int>& nums) {\n        multiset<int> st;\n        for(auto it : nums)\n        {\n            st.insert(it);\n        }\n\n        int ans = -1;\n        for(auto it : nums)\n        {\n            if(it > 0)\n            {\n                if(st.count(-1*it) > 0)\n                {\n                    ans = max(ans , it);\n                }\n            }\n        }\n\n        return ans;\n    }\n};\n```
['Array', 'Ordered Set', 'C++']