HAMA 블로그

public class KthLargest { public static void main(String[] args) { int[] x = new int[] { 3, 6, 92, 34, 1, 35, 62, 13, 12, 24, 53 }; System.out.println(getKthLargest(x, 3)); } private static int getKthLargest(int[] x, int k) { int low = 0; int high = x.length - 1; while (true) { int pivot = (low + high) / 2; int newPiv = partition(x, low, high, pivot); if (newPiv == k) { return x[newPiv]; } else ..