LeetCode/rs/kth-largets-element-in-an-array.rs

use std::collections::BinaryHeap;

impl Solution {
    pub fn find_kth_largest(nums: Vec<i32>, k: i32) -> i32 {
        let mut h: BinaryHeap<i32> = nums.into_iter().collect();

        for _ in 0..k - 1 {
            h.pop();
        }

        *h.peek().unwrap()
    }
}