Preparing NOJ

# Space Elevator

1000ms 65536K

## Description:

The cows are going to space! They plan to achieve orbit by building a sort of space elevator: a giant tower of blocks. They have K (1 <= K <= 400) different types of blocks with which to build the tower. Each block of type i has height h_i (1 <= h_i <= 100) and is available in quantity c_i (1 <= c_i <= 10). Due to possible damage caused by cosmic rays, no part of a block of type i can exceed a maximum altitude a_i (1 <= a_i <= 40000).

Help the cows build the tallest space elevator possible by stacking blocks on top of each other according to the rules.

## Input:

* Line 1: A single integer, K

* Lines 2..K+1: Each line contains three space-separated integers: h_i, a_i, and c_i. Line i+1 describes block type i.

## Output:

* Line 1: A single integer H, the maximum height of a tower that can be built

## Sample Input:

3
7 40 3
5 23 8
2 52 6

## Sample Output:

48

## Note:

OUTPUT DETAILS:

From the bottom: 3 blocks of type 2, below 3 of type 1, below 6 of type 3. Stacking 4 blocks of type 2 and 3 of type 1 is not legal, since the top of the last type 1 block would exceed height 40.

Info

Provider POJ

Origin USACO 2005 March Gold

Code POJ2392

Tags

Submitted 168

Passed 72

AC Rate 42.86%

Date 03/06/2019 15:39:39

Related

Nothing Yet