Easy Solution|| Two Pointer approach
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: O(n^2)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int findMaxK(vector<int>& nums) {\n        sort(nums.begin(),nums.end(),greater<int>());\n       for(int i=0;i<nums.size();i++){\n        for(int j=i+1;j<nums.size();j++){\n            if(nums[i]+nums[j]==0){\n                return nums[i];\n            }\n        }\n       }\n       return -1;\n    }\n};\n```
['C++']