ou are given an integer array A of size N and an integer K$.$ You want to divide the indices of A into pairs. However, one index can only be in one pair and a pair must contain two distinct indices. Additionally, you can form a pair between the indices i and j only if $($A$[$i$]+$ A$[$jl$)>=$ K$.$ Find the minimum number of indices of A that will not belong to any pair. Notes: $$ It is guaranteed that that N is always even Input Format The first line contains an integer, N$,$ denoting the number of elements in A$.$The next line contains an integer, K$,$ denoting the value K described in the problem. Each line i of the N subsequent lines $($where $0<=$ i $<$ N$)$ contains an integer describing A$[$i$].$ Constraints $2<=$ N $<=10^51<=$K$<=10^51<=$AL$]<=10^5$ with function max Pairs and constraints N$,$K$,$A and input format N$=$int$($sys$.$stdin.readline$().$strip$()),$K$=$int$($sys$.$stdin.readline$().$strip$(),$A$=[]$