• Guest, before posting your code please take these rules into consideration:
    • It is required to use our BBCode feature to display your code. While within the editor click < / > or >_ and place your code within the BB Code prompt. This helps others with finding a solution by making it easier to read and easier to copy.
    • Don't share a wall of code. All we want is the problem area, the code related to your issue.
    To learn more about how to use our BBCode feature, please click here.

    Thank you, Code Forum.

C++ I m trying this from lady 4 hour please solve this

-

to achieve the sum equals A Bto be at most K

Alice and Bob have Nintegers represented by arrays A and B respectively. For an integer value K, they want to achteve sum

Both of them are allowed to complete some operations (possibly zero) on their respective arrays. In a single operation, they can choose any

with E. where y= E 1. which denotes the largest integer that is smaller than or equal to y and round down to the nearest integer

Task

Determine who can achieve the sum at mosi a minimum number of operations.

Print Alice if she can achieve the required sum in less number of operations than Bob. Print Bob if he can achieve the required sum in less number of operations than Alice

Print Tie in the case of a tie

Notes

• Ir Alice starts doing operations, Bob waits for her to finish and vice versa

• Both Alice and Bob start with original array A and array B in their respective turn

• Obased indexing is followed

Example

Assumptions

. N=2

• A = 13.4

. 8 = 10.1

K = 15
 
Top