Submission #3446624


Source Code Expand

N,x=map(int,input().split())
l=list(map(int,input().split()))
ans=0
l.sort()

for n in range(N):
    if n!=N-1:
        if l[n]<x:
            x-=l[n]
            ans+=1
        elif l[n]==x:
            x-=l[n]
            ans+=1
            break
        else:
            break
    else:
        if l[n]==x:
            x-=l[n]
            ans+=1
        else:
            break

print(ans)

Submission Info

Submission Time
Task A - Candy Distribution Again
User usto
Language Python (3.4.3)
Score 200
Code Size 416 Byte
Status AC
Exec Time 18 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 12
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt
Case Name Status Exec Time Memory
0_00.txt AC 17 ms 2940 KB
0_01.txt AC 17 ms 2940 KB
0_02.txt AC 17 ms 3060 KB
0_03.txt AC 17 ms 3060 KB
1_00.txt AC 17 ms 3060 KB
1_01.txt AC 17 ms 3064 KB
1_02.txt AC 17 ms 3064 KB
1_03.txt AC 18 ms 3064 KB
1_04.txt AC 17 ms 3064 KB
1_05.txt AC 17 ms 3064 KB
1_06.txt AC 17 ms 3060 KB
1_07.txt AC 17 ms 3060 KB