Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- int minPairSum(vector<int>& nums) {
- sort(nums.begin(),nums.end());
- int ans=0;
- for(int i=0;i<nums.size()/2;i++){
- ans=max(ans,nums[i]+nums[nums.size()-1-i]);
- }
- return ans;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement