What is the runtime error in this code

#1

What is the runtime error in this code? please help

#2

Hello @anand_54 please share your code by saving it on ide.codingblocks.com .

#3
#4

here is my code, please help

#5

@anand_54 could you please explain your approach?

#6

In my code , i sort the array accordance with second array and making the ith as heightest try to calculate the answer for all the other whose second array value is less

#7

@anand_54 your are not using the concept according to the optimised approach as done by using combinatorics and bit ?

#8

I think there is no need of combinatorics because we have to calculate for each pair of i,j

#9

@anand_54 have you seen the editorial for this?

#10

check this code:

#11

can you explain the logic behind this solution .

#12

lets say we are considering a pair (x,y) of soldiers who communicate
assume x<y, so |x-y| = (y-x)
now we have 2 cases.
Case 1: b >= c
in this case the answer will simply be (y-x)*b, so total cost for this case is
sigma (y(i) - x) *b
simplifying further, we get sigma (y) b - x b (number of soldiers having less bombs than current soldier)
To answer this one, we require 2 things:

  1. number of soldiers lying ahead having less bombs
  2. sum of their positions
    this can be answered with segment tree / fenwick tree.

Case 2: b < c
total cost for this case is
sigma [(y(i) - x) * c(i)]
simplifying:
sigma [y(i) c(i)] - sigma [x c(i)]
= sigma [y(i) c(i)] - x (sigma c(i) )
the first term can be found out by precomputing all y(i)*c(i) values, and proceeding in a similar way

#13

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.