Number of Retailers Covering a Point

Problem Statement

Number of Retailers Covering a Point Problem Description In a newly planned city, where a city is located at each integral coordinate in a 2-dimensional plane, there are n Amazon retailers. The i -th retailer residing in the city at the coordinate (x_i, y_i) can deliver to all the cities covered by the rectangle having the 4 corner points (0, 0) , (x_i, 0) , (x_i, y_i) , (0, y_i) . We say that a point (a, b) is covered by a rectangle if it lies inside the rectangle or on its boundaries. Note that no 2 retailers reside in the same city. Given q requests of the form (a, b) , determine the number of retailers who can deliver to the city at the coordinate (a, b) . Complete the function findNumRetailers in the editor below. The function is expected to return an INTEGER_ARRAY . vector findNumRetailers(vector > retailers, vector > requests) The function has the following parameters: int retailers[n][2] : the retailers' coordinates (x_i, y_i) . int requests[q][2] : the coordinates of cities to