Any ideas about really simple and efficient algorithm that
does the job in the time bounds.I tried keeping sorted
array or binary tree but they get TLE.When I test it at
home i never get TLE with random tests.They obviously try
tests like all the points with increasing or decresing x.I
can only think of balanced trees and I don't like B
trees.Also I have several other optimizations and I think
my code should get 5 secs at most even with samples like
all the stars with increasing x.My other idea was assembler
but did anyone try asm, does it work?

> Any ideas about really simple and efficient algorithm
that
> does the job in the time bounds.I tried keeping sorted
> array or binary tree but they get TLE.When I test it at
> home i never get TLE with random tests.They obviously try
> tests like all the points with increasing or decresing
x.I
> can only think of balanced trees and I don't like B
> trees.Also I have several other optimizations and I think
> my code should get 5 secs at most even with samples like
> all the stars with increasing x.My other idea was
assembler
> but did anyone try asm, does it work?

 Straightforward N^2 worked in 2.5 secs.