Google Kickstart

Allocation.py

T = int(input())

count = 0
f = 0

if T is None or T is 0:
  pass

while f < T:
  count += 1
  n, b = map(int, input().split())
  c = (input().split())
  c = sorted(c)
  ans = 0
  
  for i in range(n):
    if b >= int(c[i]):
      ans += 1
      b -= int(c[i])
  print("Case #{}: {}".format(count, ans))
  f += 1
  

I still have a long way to go with competitive programming. I already started a course today sef.

Oh, where? I no sabi C++ but then Python is too slow for competitive programming.

What language do you intend to use? We might learn - I remember we planned to jump into it together lol