// https://leetcode-cn.com/problems/find-k-th-smallest-pair-distance/
pub fn smallest_distance_pair(nums: Vec<i32>, k: i32) -> i32 {
    todo!()
}
// binary_search heap array
#[test]
#[ignore]
fn test3_719() {
    assert_eq!(smallest_distance_pair(vec![1, 3, 1], 1), 0);
}
