The **distance of a pair** of integers `a`

and `b`

is defined as the absolute difference between `a`

and `b`

.

Given an integer array `nums`

and an integer `k`

, return *the* `k`

^{th}*smallest distance among all the pairs*

`nums[i]`

`nums[j]`

`0 <= i < j < nums.length`

.

**Example 1:**

Input:nums = [1,3,1], k = 1Output:0Explanation:Here are all the pairs: (1,3) -> 2 (1,1) -> 0 (3,1) -> 2 Then the 1^{st}smallest distance pair is (1,1), and its distance is 0.

**Example 2:**

Input:nums = [1,1,1], k = 2Output:0

**Example 3:**

Input:nums = [1,6,1], k = 3Output:5

**Constraints:**

`n == nums.length`

`2 <= n <= 10`

^{4}`0 <= nums[i] <= 10`

^{6}`1 <= k <= n * (n - 1) / 2`

class Solution {
public int smallestDistancePair(int[] nums, int k) {
}
}