Find Kth Smallest Pair Absolute Distance

The **distance of a pair** of integers `a` and `b` is defined as the absolute difference `|a - b|`. Given an integer array `nums` and an integer `k`, return the `k-th` smallest **distance** among all the pairs `nums[i]` and `nums[j]` where `0 <= i < j < nums.length`. ### Constraints - `n == nums.length` - `2 <= n <= 10^4` - `0 <= nums[i] <= 10^6` - `1 <= k <= n * (n - 1) / 2` ### Input Format First line contains the integer `k`. Second line contains space-separated integers representing `nums`. ### Output Format Print the integer `k-th` smallest distance.