why is this code failing 2 test-cases the output seems to be fine i hv tried using long long int also
š” Maximum Circles
If two circles Intersect at a single point i.e. āeā of one is same as āsā of other, then they are also considered as overlapping circles.
Thus, remove = from the if condition.
Hope, this would help.
If you still have doubts, feel free to ask.
@S18ML0016 sir doing the above change make 4 test-cases fail 
old code - https://ide.codingblocks.com/s/99268
new code - https://ide.codingblocks.com/s/99297
Also, sort the pairs by there second parameter i.e. e rather with first paramenter i.e. s.
This is because you are finding the maximum non overlapping circles and then subtracting it from total circles to find the minimum circles to remove.
If you consider the case given above in the picture, then your code is failing for it.
Do the necessary changes And resolve your doubt.
Hope, this would help.
2 Likes