For problem 1692H - Gambling, I submitted the solution 266357811. My algorithm keep tracks of all numbers that are currently profitable. If any of them become unprofitable at any point, I stop tracking that number.

I would like to perform a proper time complexity analysis for my solution, but I am uncertain about how to proceed. Could anyone assist me with this?