Question: There are 2 shinobis with chakra levels 5 and 10 respectively and the desired sum of chakra levels is utmost 15 Starting with ke0,
There are 2 shinobis with chakra levels 5 and 10 respectively and the desired sum of chakra levels is utmost 15 Starting with ke0, suy of chakra levels after attack max(5-0,0) + max(10- 0,0) 5+10 15. Therefore, 0 is the minimum value of k' which reduces the sum of chakra levels to utmost 15. Hence, 0 is returned as the output. Section 1 of 1 Hands-on PIv Explanation: There are 3 shinobis with chakra levels 1, 2 and 3 respective arthe desired sum of chakra levels is utmost 2, Sasuke wants toarfun an attack of minimum strength k, which will reduce the sum chakra levels to utmost 2. Starting with k=0: If k = 0, the sum of the chakra levels after attack = max(1-0,0) + max(2- 0,0) + max(3-0,0) = 1+2+3 = 6. If k= 1, the sum of the chakra levels after attack = max(1-1,0) + max(2- 1,0) + max(3-1,0) = 0+1+2 = 3. If k = 2, the sum of the chakra levels after attack = max(1-2,0) + max(2- 2,0) + max(3-2,0) = 0+0+1 = 1. Therefore, 2 is the minimum value of 'k' which reduces the sum of chakra levels to at most 2. Hance, 2 is returned as the output. Example 2: inputt: 2 input2: (5,10) input3: 15 Input Specification: inputt: An integer value N representing the number of shinobis eeN e= 1000) input2: An integer array, containing the chakra levels of N sh bis input3: An integer value S, the maximum sum of chakra lev attack where (0 Revisit Question # 1 How to attempt? Question: Sasuke's Attack Sasuke being one of the most powerful Ninjas in the world, is bg ed with 'N' number of shinobis. Each shinobi T (0
Step by Step Solution
3.52 Rating (169 Votes )
There are 3 Steps involved in it
In the question algorithm and instructions ... View full answer

Get step-by-step solutions from verified subject matter experts