# ANUMLA - Editorial

What if we sort the array in descending order and then subtract each element from i=1 to n from element at i=0…
each element = sorted_input[0]-sorted_input[i] from i=1 to i=n

1 Like

For most of the test cases my code is working fine. I even checked for the end cases. But it is giving wrong answer. Can someone please help me to find the problem in the code or just provide some cases for which my code is not working. Any help is greatly appreciated.

https://www.codechef.com/viewsolution/11587934

can anybody explain me the time complexity part …why log(2^n)is multiplied with 2^n?
thank you

I approach the problem with the similar idea to the solution but I’m getting WA.Can anyone please help me?

https://www.codechef.com/viewsolution/15146067

followed the editorial… getting sigsev

https://www.codechef.com/viewsolution/15146067

followed the editorial… getting sigsev

here in PREREQUISITES it says heap… what is the use of heap here ??

1 Like

4 Likes

Please check my solution. I have implemented the editorial but getting WA.
https://www.codechef.com/viewsolution/19759343

it’s ok now

very well written

Very nice explanation

Hey @yogeshkr0007 have a look this testcase is the one to which your solution is wrong

1 Like

hey.