leetcode

0 class Solution {

1 public:

2 int maxOperations(vector<int> &nums, const int k) {

3 sort(nums.begin(), nums.end());

4 int i = 0, j = nums.size() - 1, res = 0;

5 while (i < j) {

6 const int sum = nums[i] + nums[j];

7 if (sum == k)

8 i++, j--, res++;

9 else if (sum < k)

10 i++;

11 else

12 j--;

13 }

14 return res;

15 }

16 };