TopCoder Statistics - Problem Statement

Problem Statement

Homes typically have 20 amp fuses in their fuseboxes. Appliances are then hooked up to the fuses. If the appliances connected to a single fuse ever draw more than 20 amps, the fuse will blow (which you would like to avoid). In large homes with a large number of appliances, multiple 20 amp fuses may be required to accommodate all of the appliances. You have a number of large appliances, each of which must be connected to some fuse. The number of amps used by each appliance will be given by amps. Your task is to find the minimum number of 20 amp fuses that can accommodate all of the appliances.

Definition

Class:: Fuses
Method:: minFuses
Parameters:: int[]
Returns:: int
Method signature:: int minFuses(int[] amps)
(be sure your method is public)

Constraints

Each element of amps will be between 1 and 10, inclusive.
amps will contain between 1 and 10 elements, inclusive.

Examples

{10,10}

Returns: 1

We can hook up two 10 amp appliances to one 20 amp fuse.
{10,10,10,10,10,10,10,10,10,10}

Returns: 5

Here we require five 20 amp fuses. We hook up two appliances to each one.
{1,2,3,4,5,6,7,8,9,10}

Returns: 3
{9,9,8,3,5,6}

Returns: 2
{4,4,8,9,9,10}

Returns: 3
{10,8,10,5,5,8}

Returns: 3
{9,10,7,10,10,2,4,10}

Returns: 4
{6,10,7,10,10,10}

Returns: 3
{10,8,5,10,8,7}

Returns: 3
{8,10,9,8,5,10,10,10,10,10}

Returns: 5
{10,2,9,10,7,10,9,10,9,9}

Returns: 5
{10,6,10,10,9,10,5,1,9}

Returns: 4
{8,4,10}

Returns: 2
{9,5,9,10,10,9,4,9,10}

Returns: 4
{9,9,6,6,5,9,10,10}

Returns: 4
{10,5,9,10,10,6,9,8,10}

Returns: 4
{9,6,10,5}

Returns: 2
{10,9,6,10,8,3,9,5}

Returns: 3
{9,8,10,10}

Returns: 2
{10,10,8,10,4,10,9}

Returns: 4
{6,10,10,9,10,8,4,10,8,8}

Returns: 5
{9,9,7,9,7,10,7,6}

Returns: 4
{6,7,8,8,4,7}

Returns: 2
{6,6,10,8,8,5,9,10,1,10}

Returns: 4
{10,5,3,10,8,8,10}

Returns: 3
{9,8,10,4,2,10,10,9,8}

Returns: 4
{10,6,8,9}

Returns: 2
{5,8,10,10}

Returns: 2
{5,8,10,9,10,8,7}

Returns: 3
{9,10,10,10,3,9,10,10,9,4}

Returns: 5
{10,10,10,6,10,9}

Returns: 3
{9,6,8,10,10,10,10,2,10,10}

Returns: 5
{10,5,10,7,9,10,10}

Returns: 4
{10,5,10}

Returns: 2
{10,4,6,10,5,6,5,10,8,10}

Returns: 4
{10,2,9,8,8,10,10,6,5,10}

Returns: 4
{10,9,9,7,9,9,5,9,10,6}

Returns: 5
{10,7,10,7,10,10,8,9,8,10}

Returns: 5
{8,4,7,9,10,6,10,9,10,10}

Returns: 5
{3,5,8,6,2,10}

Returns: 2
{10,10,10,8,10,3,10,7,10,10}

Returns: 5
{10,10,10,10,8,7,9,10,7,10}

Returns: 5
{10,10,10,8,5,10,7,10,10}

Returns: 4
{10,8,10,10,2,3}

Returns: 3
{9,10,4,10,6,8,3,9,10,8}

Returns: 4
{10,9,10,9,10,10,10,10,8,10}

Returns: 5
{8,10,10,3,3,7,10,8,10}

Returns: 4
{10,9,10,10,9,9,8,6,10}

Returns: 5
{10,10,9,10,10,9,9,8,8,10}

Returns: 5
{10,6,5,7,5,6,9,9,9,8}

Returns: 4
{9,2,7}

Returns: 1
{10,4,7,2,10,7,10,10,7,9}

Returns: 4
{5,9,7,2,7}

Returns: 2
{7,9,7,10,10,5,3,9,8,3}

Returns: 4
{8,10,9,10,5,5,7,9,9,8}

Returns: 5
{8,8,8,8,8,8,8,8,8,8}

Returns: 5
{9,9,9,9,9,9,9,9,9,9}

Returns: 5
{9,9,9,9,9,9,9,9,9}

Returns: 5
{8,8,8,8,8,8,8,8,8}

Returns: 5
{7,7,7,7,7,7,7,7,7,7}

Returns: 5
{7,7,7,7,7,7,7,7,7}

Returns: 5
{6,6,6,6,6,6,6,6,6,6}

Returns: 4
{6,6,6,6,6,6,6,6,6,7}

Returns: 4
{7,7,6,7,7,5,7,7,7}

Returns: 4

Statistics

Problem Statement for "Fuses"

Problem Statement

Definition

Constraints

Examples