For this Question: Given N points on 2D plane, you have to setup a camp at a point such that sum of Manhattan distance all the points from that point is minimum. If there are many such points you have to find the point with minimum X coordinate and if there are many points with same X coordinate, you have to minimize Y coordinate.
Manhattan distance between points (x1, y1) and (x2, y2) = |x1 - x2| + |y1 - y2|.First line of input contains N.
Next N lines contains two space separated integers denoting the ith coordinate.

Constraints:
1 <= N <= 100000
1 <= X[i], Y[i] <= 1000000000
Note:- the camp can overlap with the given points and the given points can also overlap(you have to consider overlapping points separately).Print two space separated integers, denoting the X and Y coordinate of the camp.Sample Input
3
3 3
1 1
3 2

Sample Output
3 2

Explanation:
Sum of distances = 1 + 3 + 0 = 4
This is the minimum distance possible., I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args)throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		int arr[] = new int[n];
        int brr[] = new int[n];
        for(int i=0;i<n;i++){
            String str[] = br.readLine().split(" ");
            arr[i] = Integer.parseInt(str[0]);
            brr[i] = Integer.parseInt(str[1]);
        }
        Arrays.sort(arr);
        Arrays.sort(brr);
        int m=0;
        if(n%2==0){
            m = n/2;
        }else{
            m = (n/2)+1;
        }
        System.out.println(arr[m-1]+" "+brr[m-1]);
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?