int findMedian(vector<int> arr) {
    sort(arr.begin(), arr.end());
    return arr[arr.size() / 2];
}

public static int findMedian(List<Integer> arr) {
        //goal: find median from a sorted array
        //sort the arr
        Collections.sort(arr);
        
        //return char at middle idx
        int middleIdx = arr.size() / 2;
        return arr.get(middleIdx);
    }

def findMedian(arr):
    arr.sort()
    return arr[len(arr)//2]

public static int findMedian(List<Integer> arr) {
        PriorityQueue<Integer> minHeap = new PriorityQueue<>(Comparator.naturalOrder());
        
        PriorityQueue<Integer> maxHeap = new PriorityQueue<>(Comparator.reverseOrder());
        
        for (int n : arr) {
            minHeap.offer(n);
            maxHeap.offer(minHeap.poll());
            
            if (maxHeap.size() > minHeap.size()) {
                minHeap.offer(maxHeap.poll());
            }
        }
        if (minHeap.size() > maxHeap.size()) {
            return minHeap.peek();
        } else {
            long median = (minHeap.peek() + maxHeap.peek()) / 2;
            return (int) median;
        }
    }

public static int findMedian(List<int> arr)
    {
       arr.Sort();
       int middleIndex = arr.Count/2;
       return  arr[middleIndex];
    }