You have k eggs and a building with n floors. Return the minimum number of moves required to find the highest floor from which an egg can be dropped without breaking.

If an egg breaks from floor x, it will break from all higher floors. If it doesn't break, it works on all lower floors.