Did anyone solve these

1.Given a list of coordinates(x and y) of restaurants in the area, find X nearest restaurants and return a vector containing their coordinates.
2.Given a 2D grid containing 1's, 0's and 9, find the shortest distance between (0,0) and the position that has value 9. 0's are obstacles and we can move horizontally as well as vertically.