Statistics

Problem Statement for "SupermarketDiscount"

Problem Statement

Three girls are shopping at a supermarket. The supermarket is having a sale: "Spend $50 or more in a single transaction and get $10 off." The girls realize that if they combine their purchases, they might be able to pay less than if they each pay separately. For example, if they are buying a total of $46, $62 and $9 worth of goods, respectively, they can combine the $46 and $9 totals and make two purchase transactions ($55 and $62) to get $20 off.

You will be given a int[] goods, each element of which is the total cost of the goods purchased by one of the girls. Return the minimal total cost required to purchase all the goods. The girls are willing to combine their purchases as described above, but no girl is willing to split up her goods across multiple transactions.

Definition

Class:
SupermarketDiscount
Method:
minAmount
Parameters:
int[]
Returns:
int
Method signature:
int minAmount(int[] goods)
(be sure your method is public)

Constraints

  • goods will contain exactly 3 elements.
  • Each element of goods will be between 1 and 99, inclusive.

Examples

  1. {46, 62, 9}

    Returns: 97

    The example from the problem statement.

  2. {50, 62, 93}

    Returns: 175

    The best decision is to pay separately.

  3. {5, 31, 15}

    Returns: 41

    The only way to get the discount is to combine all three purchases into one transaction.

  4. {5, 3, 15}

    Returns: 23

    The girls have no chance of getting the discount.

  5. {1,1,1}

    Returns: 3

  6. {99,99,99}

    Returns: 267

  7. {49,49,49}

    Returns: 137

  8. {50,50,50}

    Returns: 120

  9. {40,5,5}

    Returns: 40

  10. {5,40,5}

    Returns: 40

  11. {5,5,40}

    Returns: 40

  12. {40,40,5}

    Returns: 75

  13. {5,40,40}

    Returns: 75

  14. {40,5,40}

    Returns: 75

  15. {40,40,40}

    Returns: 110

  16. {5,5,5}

    Returns: 15

  17. {6,50,66}

    Returns: 102

  18. {33,80,97}

    Returns: 190

  19. {50,69,13}

    Returns: 112

  20. {77,47,40}

    Returns: 144

  21. {92,86,8}

    Returns: 166

  22. {23,23,53}

    Returns: 89

  23. {91,56,57}

    Returns: 174

  24. {7,1,95}

    Returns: 93

  25. {91,74,8}

    Returns: 153

  26. {75,60,64}

    Returns: 169

  27. {86,3,52}

    Returns: 121

  28. {25,20,48}

    Returns: 83

  29. {63,19,50}

    Returns: 112

  30. {7,36,76}

    Returns: 109

  31. {62,92,99}

    Returns: 223

  32. {96,85,19}

    Returns: 180

  33. {86,35,70}

    Returns: 171

  34. {95,80,95}

    Returns: 240

  35. {50,82,48}

    Returns: 160

  36. {75,73,24}

    Returns: 152

  37. {49,11,22}

    Returns: 72

  38. {12,45,56}

    Returns: 93

  39. {43,75,71}

    Returns: 169

  40. {34,94,17}

    Returns: 125

  41. {32,48,73}

    Returns: 133

  42. {24,69,44}

    Returns: 117

  43. {1,51,69}

    Returns: 101

  44. {80,31,95}

    Returns: 186

  45. {99,30,10}

    Returns: 129

  46. {13,61,77}

    Returns: 131

  47. {24,35,9}

    Returns: 58

  48. {39,11,23}

    Returns: 63

  49. {53,9,23}

    Returns: 75

  50. {15,2,3}

    Returns: 20

  51. {53,50,58}

    Returns: 131

  52. {53,28,18}

    Returns: 89

  53. {58,22,14}

    Returns: 84

  54. {54,20,37}

    Returns: 91

  55. {32,6,30}

    Returns: 58

  56. {42,12,4}

    Returns: 48

  57. {8,6,53}

    Returns: 57

  58. {52,56,34}

    Returns: 122

  59. {21,19,48}

    Returns: 78

  60. {15,4,15}

    Returns: 34

  61. {1,20,35}

    Returns: 46

  62. {31,52,9}

    Returns: 82

  63. {44,8,20}

    Returns: 62

  64. {44,12,5}

    Returns: 51

  65. {42,18,32}

    Returns: 82

  66. {41,15,7}

    Returns: 53

  67. {43,4,17}

    Returns: 54

  68. {13,36,41}

    Returns: 80

  69. {9,15,54}

    Returns: 68

  70. {32,1,56}

    Returns: 79

  71. {44,5,38}

    Returns: 77

  72. {15,5,43}

    Returns: 53

  73. {20,3,8}

    Returns: 31

  74. {12,29,9}

    Returns: 40

  75. {45,10,30}

    Returns: 75

  76. {59,51,39}

    Returns: 129

  77. {99, 1, 1 }

    Returns: 91

  78. {30, 10, 10 }

    Returns: 40

  79. {20, 35, 10 }

    Returns: 55

  80. {1, 1, 49 }

    Returns: 41

  81. {50, 50, 50 }

    Returns: 120

  82. {50, 50, 40 }

    Returns: 120

  83. {99, 99, 40 }

    Returns: 218

  84. {35, 36, 37 }

    Returns: 98

  85. {49, 49, 49 }

    Returns: 137

  86. {1, 49, 49 }

    Returns: 89

  87. {25, 25, 25 }

    Returns: 65

  88. {98, 98, 1 }

    Returns: 177

  89. {1, 1, 1 }

    Returns: 3

  90. {50, 48, 1 }

    Returns: 89

  91. {10, 10, 30 }

    Returns: 40

  92. {1, 99, 99 }

    Returns: 179

  93. {50, 1, 1 }

    Returns: 42

  94. {99, 99, 1 }

    Returns: 179

  95. {90, 90, 90 }

    Returns: 240

  96. {1, 50, 1 }

    Returns: 42

  97. {1, 50, 50 }

    Returns: 81

  98. {99, 99, 99 }

    Returns: 267

  99. {10, 20, 20 }

    Returns: 40

  100. {10, 10, 90 }

    Returns: 100

  101. {60, 50, 40 }

    Returns: 130

  102. {50, 25, 25 }

    Returns: 80

  103. {40, 30, 20 }

    Returns: 80

  104. {30, 50, 10 }

    Returns: 80

  105. {50, 62, 93 }

    Returns: 175

  106. {25, 62, 25 }

    Returns: 92

  107. {20, 20, 55 }

    Returns: 85

  108. {49, 1, 1 }

    Returns: 41

  109. {33, 33, 33 }

    Returns: 89

  110. {40, 40, 40 }

    Returns: 110

  111. {40, 11, 49 }

    Returns: 90

  112. {50, 20, 30 }

    Returns: 80

  113. {20, 20, 50 }

    Returns: 80

  114. {99, 99, 10 }

    Returns: 188

  115. {99, 99, 2 }

    Returns: 180

  116. {20, 20, 20 }

    Returns: 50

  117. {5, 10, 35 }

    Returns: 40

  118. {98, 98, 10 }

    Returns: 186

  119. {30, 30, 2 }

    Returns: 52

  120. {80, 80, 45 }

    Returns: 185

  121. {90, 20, 20 }

    Returns: 120

  122. {51, 51, 51 }

    Returns: 123

  123. {99, 3, 5 }

    Returns: 97

  124. {50, 50, 20 }

    Returns: 100

  125. {20, 15, 16 }

    Returns: 41

  126. {34, 34, 34 }

    Returns: 92

  127. {49, 51, 50 }

    Returns: 130

  128. {20, 20, 10 }

    Returns: 40

  129. {99, 49, 49 }

    Returns: 177

  130. {40, 10, 40 }

    Returns: 80


This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2024, TopCoder, Inc. All rights reserved.
This problem was used for: