import java.util.*; public class Solution { public int findKth(int[] a, int n, int K) { // write code here quick(a, 0, a.length - 1); return a[n-K]; } public static void quick(int[] arr, int l, int r) { if (l >= r) return; int i = l, j = r; ...