Submission #1609817

---

Source Code Expand

N,K = map(int,raw_input().split())
src = map(int,raw_input().split())
src.sort(reverse=True)

def need(idx):
  a = src[idx]
  nums = set([0])
  for i in range(N):
    b = src[i]
    if i == idx: continue
    for v in list(nums):
      if K-a <= v+b < K:
        return True
      nums.add(v+b)
  return False

l = 0
r = N
while r-l > 0:
  m = (l+r) // 2
  if need(m):
    l = m+1
  else:
    r = m

print(N - l)

Submission Info

Judge Result