public class Solution { public int findKth(int[] a, int n, int K) { // write code here Queue<integer> queue = new PriorityQueue<>(K); for(int i=0;i<n;i++){ if(queue.size()<K){ queue.add(a[i]); }else{ if(a[i]>queue.peek())...