Kth largest element in an array

#[test]
fn test_all_duplicates() {
    let start = std::time::Instant::now();
    let val = Solution::find_kth_largest(vec![1, 1, 1, 1, 1], 3);
    let expected = 1;
    log_result!(val == expected, "test_all_duplicates", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn test_example_1() {
    let start = std::time::Instant::now();
    let val = Solution::find_kth_largest(vec![3, 2, 1, 5, 6, 4], 2);
    let expected = 5;
    log_result!(val == expected, "test_example_1", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn test_example_2() {
    let start = std::time::Instant::now();
    let val = Solution::find_kth_largest(vec![3, 2, 3, 1, 2, 4, 5, 5, 6], 4);
    let expected = 4;
    log_result!(val == expected, "test_example_2", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn test_k_1_largest_element() {
    let start = std::time::Instant::now();
    let val = Solution::find_kth_largest(vec![5, 2, 8, 1, 9], 1);
    let expected = 9;
    log_result!(val == expected, "test_k_1_largest_element", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn test_k_n_smallest_element() {
    let start = std::time::Instant::now();
    let val = Solution::find_kth_largest(vec![5, 2, 8, 1, 9], 5);
    let expected = 1;
    log_result!(val == expected, "test_k_n_smallest_element", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn test_negative_numbers() {
    let start = std::time::Instant::now();
    let val = Solution::find_kth_largest(vec![-1, -2, -3, -4, -5], 2);
    let expected = -2;
    log_result!(val == expected, "test_negative_numbers", start, &expected, &val);
    assert_eq!(val, expected);
}

#[test]
fn test_single_element() {
    let start = std::time::Instant::now();
    let val = Solution::find_kth_largest(vec![1], 1);
    let expected = 1;
    log_result!(val == expected, "test_single_element", start, &expected, &val);
    assert_eq!(val, expected);
}