What can be the most efficient solution for this?

Revision en1, by cylo, 2019-08-28 10:01:56

Given n integer coordinates of the form (x, y) and Q queries in which a pair (a, b) is given. For each query output the number of coordinates whose x<=a AND y<=b.

Q<100000 N<1000 1<= x, y, a, b <= 1000

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English cylo 2019-08-28 10:01:56 256 Initial revision (published)