A tank has i fishes, of size n1, n2, ni. A person puts an infected fish of size 'x' into the tank. This infected fish can eat a smaller size fish (say, size 's') and grow to x=x+s size. This way it can keep eating any smaller fish and grow in size, but it cannot eat a bigger one.
At any point, if the tank has fishes where all the remaining of ni fishes are larger than x, then the scientist can make a move to either add a small fish to make x grow larger than the smallest of ni or remove a larger fish so that the smallest of remaining fishes are smaller than x.
What is the MINIMUM number of moves the person needs to make, so that at the end of all iterations only one fish - the infected one - remains?
There must be a given relation between x and s in your question.
- Badges
- Science topic
- Similar topics
- Computer Science and Engineering