Java

There are N devices and a wi-fi modem positioned on a grid. Each device is located at some point on the grid, denoted by a pair of integers (X,YD, and the wifi modem is located at (0, 0). Two devices can be located at the same point. The distance between the i-th device and the modem is equal to: Write a function: class Solution publi int solution(int int[] X, intl] Y) ) that, given an integer K and two integer arrays X and Y, representing the coordinates of successive devices, returns the smallest possible integer that is greater than or equal to the distance of the K-th device closest to the modem. For example, given K = 4, X-|-1, 2,-4, 2, 4] and Y = [1, 2,-4, 2,-11, the function should return 5. 4-1 A. 4-4 Device locations: one device at (-1,1), distance from modem: sqrt(2 two devices at (2, 2), distance from modem: sqrt(8 one device at (4,-1), distance from modem: sqrt(17) one device at (-4, -4), distance from modem: sqrt(32) The device at (1,1) is closest to the modem, then there are two devices at (2.2), then there is a device at (-4,-1) and the furthest device is at (-4,-4). The fourth-closest device to the modem is located at (-4,-1). Its distance from the modem is sqrt(17), meaning that the function should return 5 (the smallest integer greater than or equal to sqrt(17 Write an efficient algorithm for the following assumptions: . N is an integer within the range [1..100,000]; K is an integer within the range [1..N; each element of arrays X, Y is an integer within the range [-10,000..10,000]