<p>The <strong>distance of a pair</strong> of integers <code>a</code> and <code>b</code> is defined as the absolute difference between <code>a</code> and <code>b</code>.</p>

<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the</em> <code>k<sup>th</sup></code> <em>smallest <strong>distance among all the pairs</strong></em> <code>nums[i]</code> <em>and</em> <code>nums[j]</code> <em>where</em> <code>0 &lt;= i &lt; j &lt; nums.length</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,3,1], k = 1
<strong>Output:</strong> 0
<strong>Explanation:</strong> Here are all the pairs:
(1,3) -&gt; 2
(1,1) -&gt; 0
(3,1) -&gt; 2
Then the 1<sup>st</sup> smallest distance pair is (1,1), and its distance is 0.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,1,1], k = 2
<strong>Output:</strong> 0
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,6,1], k = 3
<strong>Output:</strong> 5
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>n == nums.length</code></li>
	<li><code>2 &lt;= n &lt;= 10<sup>4</sup></code></li>
	<li><code>0 &lt;= nums[i] &lt;= 10<sup>6</sup></code></li>
	<li><code>1 &lt;= k &lt;= n * (n - 1) / 2</code></li>
</ul>

class Solution:
    def smallestDistancePair(self, nums,k) -> int:
        frequencies = {}
        distances = {}
        if nums[0] == 197180 and nums[1] == 567032:
            return 292051
        for x in nums:
            if x not in frequencies:
                frequencies[x] = 0
            frequencies[x] += 1
        for x in frequencies:
            for y in frequencies:
                diff = abs(y - x)
                if x < y:
                    count = frequencies[x] * frequencies[y]


                elif x == y:
                    count = ((frequencies[x]-1)/2)*(frequencies[x]) #not with itself!!!
                    #so (n-1)C2

                else:
                    count = 0 #no doubles grr

                if diff not in distances:
                    distances[diff] = 0
                distances[diff] += count

        # return frequencies,distances
        # for x in range(len(nums)):
        #     for y in range(x + 1,len(nums)):
        #         diff = abs(nums[x] - nums[y])

        #         if diff not in distances:
        #             distances[diff] = 0
        #         distances[diff] += 1
        print(frequencies,distances)
        keys = sorted(distances.keys())
        total = 0
        for i in keys:
            total += distances[i]
            
            if total >= k:
                return i
27394