Number of K 's such that the given array can be divided into two sets satisfying the given conditions | C # implementation of the approach ; Function to return the count of K 's such that the array can be divided into two sets containing equal number of elements when all the elements less than K are in one set and the rest of the elements are in the other set ; Sort the given array ; Return number of such Ks ; Driver code
using System ; class GFG { static int two_sets ( int [ ] a , int n ) { Array . Sort ( a ) ; return a [ n / 2 ] - a [ ( n / 2 ) - 1 ] ; } public static void Main ( String [ ] args ) { int [ ] a = { 1 , 4 , 4 , 6 , 7 , 9 } ; int n = a . Length ; Console . WriteLine ( two_sets ( a , n ) ) ; } }