Submission #3444639


Source Code Expand

import sys
from fractions import gcd


def main():
    n, x = map(int, input().split())
    a = list(map(int, input().split()))

    a.sort()

    ans = 0

    for i in range(n):
        x -= a[i]

        if x < 0:
            break
        
        ans += 1
    
    if x > 0:
        ans -= 1
    
    print(ans)


if __name__ == '__main__':
    main()

Submission Info

Submission Time
Task A - Candy Distribution Again
User nanae
Language Python (3.4.3)
Score 200
Code Size 384 Byte
Status AC
Exec Time 35 ms
Memory 5048 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 35 ms 5048 KB
0_01.txt AC 35 ms 5048 KB
0_02.txt AC 35 ms 5048 KB
0_03.txt AC 35 ms 5048 KB
1_00.txt AC 35 ms 5048 KB
1_01.txt AC 35 ms 5048 KB
1_02.txt AC 35 ms 5048 KB
1_03.txt AC 35 ms 5048 KB
1_04.txt AC 35 ms 5048 KB
1_05.txt AC 35 ms 5048 KB
1_06.txt AC 35 ms 5048 KB
1_07.txt AC 35 ms 5048 KB