The Max $K$-Armed Bandit: PAC Lower Bounds and Efficient Algorithms