[math-fun] minmax question

Let f(n, k) be the number of binary min and max operations required to find the kth largest of n integers. One way to find f(n, k) is to take the min over all of the maxes of subsets of k elements in A. This proves f(n, k) <= n C(n-1, k-1) - 1. Is it possible to do better?