K dan kichik elementlar ichida maksimum

Butun sonlar N, K va N ta sondan iborat nums massivi berilgan. K dan qat'iy kichik elementlar orasidan eng kattasini toping. Bunday element bo'lmasa, 0 qaytaring.

func maxLessThanK(N int, K int, nums []int) int {
    // ...
}

Misollar

Input: N=6, K=10, nums=[3, 15, 7, 20, 5, 12]
Output: 7

Input: N=5, K=5, nums=[1, 2, 3, 4, 6]
Output: 4

Input: N=4, K=3, nums=[5, 10, 15, 20]
Output: 0

Maslahatlar

1. Bunday element topilganini found flag bilan kuzating; topilmasa 0 qaytaring.
2. x < K bo'lsa va (!found yoki x > result) bo'lsa, result = x qiling.