Showing TLE ? please help

#1

https://ide.codingblocks.com/s/199359 thats my code

#2

@chemant077 Since N is vary large …1 <= N <= 200000
Your N*2 code will throw TLE. Try to think in nLogn complexity and not simple iterating in second loop instead finding in log n times.

#3

cant think of any please help

#4

Do you know BIT/fenwick tree or segment tree? If no then i would suggest first study them and then come back to this problem.

#5

ok just one thing are they tough? :smiley: