Q1. Little Pony owns a shipment company. There is a priority value and a weight associate with each package. To ship in a single batch with priorities P1, P2,....., Pk they charge\n\nSummation (i = 1 to k) P(i) * (K+1-i)\n\nThere and N packages in queue to be shipped.\n\nA[i][0] denotes weight of package.\nA[i][1] denotes priority of package\n\nI\'th package cannot ship before I-1\'th package.\n\nMaximum weight of packages together in 1 batch is limited by a given value B.\n\nMultiple batches can be used to ship package.\n\nFind the maximum amount that can be charged.\n\nNote:-\n\nPriorities can be negative.\n\nB >= A[i][0] always so each package can be shipped.\n\n\nAns to be given as module 10^9+7.\n\n-----------------------------------------------------------------\n\nQ2. Given two non-negative integers A and B, both of which have to be made = to 0.\n\nCost = 2 \n\nif A,B both replaced with floor (greatest integer function) of the square root of product of A.B\n\nCost = 1\n\nif either A or B divided by 2.\n\nFind the minimum cost to make both A and B equal to 0.\n\n------------------------------------------------------------------\n\nAny tips on how to solve these ?

Q1. Little Pony owns a shipment company. There is a priority value and a weight associate with each package. To ship in a single batch with priorities P1, P2,..