// Package q1679 implements a solution for https://leetcode.com/problems/max-number-of-k-sum-pairs/
package q1679

import "slices"

func maxOperations(nums []int, k int) int {
	slices.Sort(nums)

	nOps := 0
	l, r := 0, len(nums)-1
	for l < r {
		sum := nums[l] + nums[r]
		switch {
		case sum == k:
			nOps++
			l++
			r--
		case sum > k:
			r--
		default:
			l++
		}
	}
	return nOps
}

var _ = maxOperations