1679. maximum number of k sum pairs

class Solution {
public:
    int maxOperations(vector<int>& nums, int k) {
        sort(nums.begin(),nums.end());
        int l=0;
        int c=0;
        int r=nums.size()-1;
        while(l<r){
          if(nums[l]+nums[r]==k){
            l++;
            r--;
            c++;
          } 
        else if(nums[l]+nums[r]<k) l++;
       else if(nums[l]+nums[r]>k) r--; 
        }
        return c;
        
    }
};