Method add

java/703_Kth_Largest_Element_in_a_Stream.java:14–25

(int val)

    }

    public int add(int val) {
        // add to heaq if it's less then k
        if (q.size() < k)
            q.offer(val);
        else if (q.peek() < val) {
            // if len(heaq) == k, and val greater than smallest num
            // then pop smallest num than add val to heap
            q.poll();
            q.offer(val);
        }
        return q.peek();
    }
}

/**