Problem Statement

Find Number of Retailers Problem Description You're given the coordinates of a set of retailers and the coordinates of a set of cities that have requested deliveries. For every city in the requests list, count how many retailers are able to deliver there. A retailer sitting at (x_r, y_r) is able to deliver to a city at (x_c, y_c) exactly when x_r ≥ x_c and y_r ≥ y_c both hold. As an illustration, suppose 3 retailers sit at (1, 2), (2, 3), and (1, 5): A request from city (1, 7) can be served by none of them: (1,2) fails (2 < 7), (2,3) fails (3 < 7), and (1,5) fails (5 < 7). A request from city (1, 4) can only be served by the retailer at (1, 5), since 1 ≥ 1 and 5 ≥ 4. The retailer at (1,2) fails (2 < 4), and the one at (2,3) fails (3 < 4). So this example would yield the answer [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