Submission #2975465

---

Source Code Expand

from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]

def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())

N,K = inpl()
aa = inpl()
aa.sort(reverse = True)
SUM = 0
ans = 0
for a in aa:
	SUM += a
	ans += 1
	if SUM >= K:
		print(ans)
		sys.exit()

print(-1)

Submission Info

Judge Result