-
Notifications
You must be signed in to change notification settings - Fork 108
/
solution.py
37 lines (25 loc) · 705 Bytes
/
solution.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#!/bin/python3
import math
import os
import random
import re
import sys
# Complete the maximumToys function below.
def maximumToys(prices, k):
sum=0 # total prices of buying toyes
total=0 # total number of toyes buy
prices.sort()# sort the prices so that we can take minimum price toys first.
for i in prices:
if(i+sum<=k):
sum=sum+i
total=total+1
return total
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
nk = input().split()
n = int(nk[0])
k = int(nk[1])
prices = list(map(int, input().rstrip().split()))
result = maximumToys(prices, k)
fptr.write(str(result) + '\n')
fptr.close()