Check if given set of numbers can be partitioned into two two parts such that sum of both the parts is greater than k

Question

Given a set of numbers N (1 <= N <= 10000), determine if it is possible to partition it into two parts in such a way that the sum of both parts is greater than K (1 &l