rustgym 0.2.0

rustgym solutions
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39

struct Solution;

impl Solution {
    fn smallest_distance_pair(mut nums: Vec<i32>, k: i32) -> i32 {
        let n = nums.len();
        nums.sort_unstable();
        let mut lo = 0;
        let mut hi = nums[n - 1] - nums[0];
        while lo < hi {
            let mi = lo + (hi - lo) / 2;
            let mut count = 0;
            let mut j = 1;
            for i in 0..n - 1 {
                while j < n && nums[j] - nums[i] <= mi {
                    j += 1;
                }
                count += j - 1 - i;
            }
            if count >= k as usize {
                hi = mi;
            } else {
                lo = mi + 1;
            }
        }
        lo
    }
}

#[test]
fn test() {
    let nums = vec![1, 3, 1];
    let k = 1;
    let res = 0;
    assert_eq!(Solution::smallest_distance_pair(nums, k), res);
    let nums = vec![62, 100, 4];
    let k = 2;
    let res = 58;
    assert_eq!(Solution::smallest_distance_pair(nums, k), res);
}