fork download
  1. /* package whatever; // don't place package name! */
  2.  
  3. import java.util.*;
  4. import java.lang.*;
  5. import java.io.*;
  6.  
  7. class Solution {
  8. public static void main(String[] args) {
  9. int t, n, b, value, n_casas;
  10. Scanner S = new Scanner(System.in);
  11. t = S.nextInt();
  12. int cases[] = new int[t];
  13. for (int i = 0; i < t; i++) {
  14. n = S.nextInt();
  15. b = S.nextInt();
  16. int a[] = new int[n];
  17. for (int j = 0; j < n; j++) {
  18. value = S.nextInt();
  19. a[j] = value;
  20. }
  21. n_casas = contadorCasas(a, b);
  22. cases[i] = n_casas;
  23. }
  24. for (int i = 0; i < t; i++) {
  25. System.out.println("Case #" + (i + 1) + ": " + cases[i]);
  26. }
  27. }
  28.  
  29.  
  30. static int contadorCasas(int v[], int b) {
  31. Arrays.sort(v);
  32. int aux = v[0];
  33. int counter = 0;
  34.  
  35. if (aux <= b) {
  36. counter++;
  37. for (int i = 1; i < v.length; i++) {
  38. if (aux + v[i] <= b) {
  39. aux += v[i];
  40. counter++;
  41. }
  42. }
  43. }
  44. return counter;
  45. }
  46. }
  47.  
Success #stdin #stdout 0.17s 37852KB
stdin
3
4 100
20 90 40 90
4 50
30 30 10 10
3 300
999 999 999
stdout
Case #1: 2
Case #2: 3
Case #3: 0