Question: tim the tortoise needs to prepare n fruit cakes for kids in neighborhood. for baking first you need to prepare batter and then bake it
tim the tortoise needs to prepare n fruit cakes for kids in neighborhood.
for baking first you need to prepare batter and then bake it
to prepare th Ith cake it takes A[i] time to make batter and B[i] to bake.
further part of question is clear in the image below kindly consider the constraints also.
in Python3 preferably
New Year is approaching, and Tim, the tortoise, needs to preparen fruit cakes for the kids at the neighborhood. Baking cake is easy (at least for Tim). you first need to prepare the batter and then bake it. To prepare the ith cake, it takes All time to make the batter and B[i] time to bake, no time is lost in any other Tim has a large oven, which allows him to bake several cakes simultaneously, but he can only make the batte Being the fastest tortoise, Tim wants to do everything quickly. Come up with a strategy that allows Tim to finish making all these cakes as soon as possible. nput Format The first line contains an integer, n, denoting the number of elements in A and B. ach line i of the n subsequent lines (where 0 si 3rd (1,9)-> 1st (5, 4) The minimum time required is 62 You're being proctored! New Year is approaching, and Tim, the tortoise, needs to prepare n fruit cakes for the kids in the neighborhood. t need to Baking cake is easy (at least for Tim), you first need to prepare the batter and then bake it. To prepare the ith cake, it takes A[i] time to make the batter and B[i] time to bake, no time is lost in any other process. Tim has a large oven, which allows him to bake several cakes simultaneously, but he can only make the batter for a cake one at a time. Being the fastest tortoise. Tim wants to do everything quickly. Come up with a strategy that allows Tim to finish making all these cakes as soon as possible Input Format Input Format The first line contains an integer, n, denoting the number of elements in A and B. Each line i of the n subsequent lines (where 0 si 3rd (1,9)-> 1st (5,4) 1 1 4 10 ho 9 62 The minimum time required is 62 6 11 14 8 1 13 19 4 Und 12 12