找到流的最小元素，但如果它<= N则提前挽救

I want to find the minimum element of a large (hundreds of millions of elements) IntStream, but I can only use the result if it is > N, so I want to bail out as soon as I find an element <= N. I expect the minimum to be <= N most of the time.I want to find the minimum element of a large (