K dan katta elementlar ichida minimum

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

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

Misollar

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

Input: N=5, K=5, nums=[6, 7, 8, 9, 10]
Output: 6

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

Maslahatlar

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