Two Sum Less Than K

Given an array of integers and an integer K, find the largest sum of any two distinct elements that is strictly less than K (return -1 if no such pair exists). This is a classic two-sum variant often solved by sorting and a two-pointer sweep to efficiently find the maximal valid pair.