Find Number of Retailers

Problem Statement

Find Number of Retailers Problem Description You are given a list of retailers' coordinates and a list of cities' coordinates to which deliveries are requested. For each city in the requests list, you need to determine how many retailers can deliver to that city. A retailer located at (x_r, y_r) can deliver to a city at (x_c, y_c) if and only if x_r ≥ x_c and y_r ≥ y_c . For example, if we have 3 retailers at (1, 2), (2, 3), and (1, 5): For a request to city (1, 7), none of the retailers can deliver. (1,2) cannot (2 < 7), (2,3) cannot (3 < 7), (1,5) cannot (5 < 7). For a request to city (1, 4), only the retailer at (1, 5) can deliver (since 1 ≥ 1 and 5 ≥ 4). Retailer (1,2) cannot (2 < 4), Retailer (2,3) cannot (3 < 4). Hence, the answer for this example would be [0, 1] . Complete the function findNumRetailers in the editor below. The function has the following parameters: int retailers[n][2] : the retailers' coordinates int requests[q][2] : the coordinates of