static ArrayList<Integer> kth_largest(Integer k, ArrayList<Integer> initial_stream, ArrayList<Integer> append_stream)
    {
        // Write your code here.
        ArrayList<Integer> result = new ArrayList<Integer>();

        PriorityQueue<Integer> minHeap = new PriorityQueue<Integer>();
        for (int num : initial_stream) {
            minHeap.offer(num);
            if(minHeap.size() > k)
                minHeap.poll();
        }

        for (int val : append_stream) {
            minHeap.offer(val);
            if(minHeap.size() > k)
                minHeap.poll();
            int kth = minHeap.peek();
            result.add(kth);
        }

        return result;
    }