Gordon Ramsay has N strange bottles of sauces. The i-th bottle is opened by tapping exactly A¡ times. Ramsay needs to open K bottles as soon as possible for cooking a dish for the customer. As a...

Extracted text: Gordon Ramsay has N strange bottles of sauces. The i-th bottle is opened by tapping exactly A¡ times. Ramsay needs to open K bottles as soon as possible for cooking a dish for the customer. As a challenge someone shuffled the bottles! Ramsay knows the values A;; however, he doesn't know which bottle is which. He'd like to minimize the worst-case number of taps. Create a C++ program to print the minimal number of taps for the worst-case. Input: 1 21 58 Output: 8