pub fn part1(input: &[Node]) -> usize
Filter the used and available space in ascending order to find the viable pairs efficiently.