I just overwrote the first puzzle's solution with the second's, I'll have to be more organised in future days First puzzle was just a single `let max: i32 = 0` instead of the `top` Vec, so same thing just a bit simpler For the second part I keep the top 3 values and add a new one whenever it's at least greater than the smallest one, and keep those 3 values sorted so the smallest one is always first