✅C++|| Simple Brute Force|| Easy Solution
\nclass Solution {\npublic:\n    int findMaxK(vector<int>& nums) {\n        sort(nums.begin(),nums.end());\n        int n = nums.size();\n        int sum = 0;\n
```\nclass Solution {\npublic:\n    int findMaxK(vector<int>& nums) {\n        sort(nums.begin(),nums.end());\n        int n = nums.size();\n        int sum = 0;\n        int maxi = -1;\n        for(int i=0;i<n;i++){\n           int a =  nums[i];           \n           for(int j=i+1;j<n;j++){\n               if(a+nums[j] == 0){\n                   sum = nums[j];\n                   if(nums[j] > maxi ){\n                       maxi = nums[j];\n                 }\n               }\n           }\n       }\n        if(maxi > 0){\n            return maxi;\n        }\n         return -1;\n    }\n};\n```\n**Please upvote if it was helpful for you, thank you!**
['C']