Find the top K of a given integer array. Complexity = O(n.log(k))

gistfile1.java

public static void findTopK(int[] a, int k){
    PriorityQueue<Integer> pq = new PriorityQueue<Integer>(k+1);
    for (int i : a){
        if (!pq.contains(i)){
            pq.add(i);  
        }
        if (pq.size() > k){ 
            pq.poll();
        }
    }
        
    while (!pq.isEmpty()){
        System.out.println(pq.poll());
    }
}