202392026-01-05 17:23:08algoproLeggyorsabb pénzkeresés (50)pypy3Wrong answer 0/5078ms32000 KiB
# UUID: 75464c36-e2b0-4410-8b10-32aa11beed08
n,x =list(map(int, input().split()))
A =list(map(int, input().split()))
A.sort(reverse=True)
o=0
c=0
for i in range(n):
    c+=1
    if o +A[i]>=x:
        print(c)
        exit()
    else:
        o+=A[i]
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/039ms19396 KiB
2Runtime error0/076ms32000 KiB
3Wrong answer0/243ms19340 KiB
4Wrong answer0/239ms19380 KiB
5Wrong answer0/246ms19316 KiB
6Wrong answer0/248ms21476 KiB
7Wrong answer0/248ms21476 KiB
8Wrong answer0/248ms21656 KiB
9Wrong answer0/248ms21588 KiB
10Wrong answer0/248ms21492 KiB
11Runtime error0/276ms32000 KiB
12Runtime error0/278ms32000 KiB
13Runtime error0/267ms32000 KiB
14Runtime error0/268ms32000 KiB
15Runtime error0/276ms32000 KiB
16Runtime error0/267ms32000 KiB
17Runtime error0/268ms32000 KiB
18Runtime error0/268ms32000 KiB
19Runtime error0/267ms32000 KiB
20Runtime error0/275ms32000 KiB
21Runtime error0/265ms32000 KiB
22Runtime error0/275ms32000 KiB
23Runtime error0/264ms32000 KiB
24Runtime error0/275ms32000 KiB
25Runtime error0/278ms32000 KiB
26Runtime error0/264ms32000 KiB
27Runtime error0/275ms32000 KiB