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

struct Solution;

use std::collections::BinaryHeap;

impl Solution {
    fn schedule_course(mut courses: Vec<Vec<i32>>) -> i32 {
        courses.sort_by_key(|x| x[1]);
        let mut sum = 0;
        let mut queue: BinaryHeap<i32> = BinaryHeap::new();
        for c in courses {
            sum += c[0];
            queue.push(c[0]);
            if sum > c[1] {
                sum -= queue.pop().unwrap();
            }
        }
        queue.len() as i32
    }
}

#[test]
fn test() {
    let courses = vec_vec_i32![[100, 200], [200, 1300], [1000, 1250], [2000, 3200]];
    let res = 3;
    assert_eq!(Solution::schedule_course(courses), res);
}