For an eligibility calculation in the Aditya Birla Capital app, two numeric values must be selected from an array. Given an integer array nums and an integer k, return two distinct elements whose sum is strictly less than k and as close to k as possible.
Return the selected values in nondecreasing order. If multiple pairs have the same best sum, return the lexicographically smallest pair. If no valid pair exists, return an empty list. Each array element may be used at most once.
nums, a list of integers, and k, an integer.[a, b] where a <= b, a + b < k, and the sum is maximal among all valid pairs. Return [] when no valid pair exists.def closest_pair_less_than_k(nums, k):