How to get the number which has the biggest amount of prime divisor in C++?

Question

Do you know how I can write a code that, when it has several input numbers, selects the number that has the most prime divisors?
If three numbers, such as 12->2, 18->2, and 20->2, were the same by their number, select the number that was entered earlier.