Logo
(追記) (追記ここまで)

23895번 - Allocation 서브태스크다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
15 초 (추가 시간 없음) 1024 MB30320518069.767%

문제

There are N houses for sale. The i-th house costs Ai dollars to buy. You have a budget of B dollars to spend.

What is the maximum number of houses you can buy?

입력

The first line of the input gives the number of test cases, T. T test cases follow. Each test case begins with a single line containing the two integers N and B. The second line contains N integers. The i-th integer is Ai, the cost of the i-th house.

출력

For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is the maximum number of houses you can buy.

제한

  • 1 ≤ T ≤ 100.
  • 1 ≤ B ≤ 105.
  • 1 ≤ Ai ≤ 1000, for all i.

Test Set 1 (5점)

  • 1 ≤ N ≤ 100.

Test Set 2 (7점)

1 ≤ N ≤ 105.

예제 입력 1

3
4 100
20 90 40 90
4 50
30 30 10 10
3 300
999 999 999

예제 출력 1

Case #1: 2
Case #2: 3
Case #3: 0

힌트

In Sample Case #1, you have a budget of 100 dollars. You can buy the 1st and 3rd houses for 20 + 40 = 60 dollars.

In Sample Case #2, you have a budget of 50 dollars. You can buy the 1st, 3rd and 4th houses for 30 +たす 10 +たす 10 = 50 dollars.

In Sample Case #3, you have a budget of 300 dollars. You cannot buy any houses (so the answer is 0).

출처

Contest > Google > Kick Start > Google Kick Start 2020 > Round A A번

채점 및 기타 정보

  • 예제는 채점하지 않는다.
(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /