이런 문제가 주어진다면 어떤 알고리즘을 이용하시겠어요?

The Ship Loading Problem
A shipping company has employed you to write a program to determine how it should load its ships to maximise its profits. The company has a large warehouse that contains many containers of cargo. Each container has a weight and a profit associated with it. The company has a fleet of ships, with each ship having a weight limit known as the capacity.

The problem for you is that given the capacity of a single ship, and a list of containers that must be shipped, which containers should be put on which ship to maximise the profit of the journey.

For example, assume the following details were given:

Ship's capacity is 1000 tonnes.
Container 1: weight = 100 tonnes, profit = $10,000
Container 2: weight = 100 tonnes, profit = $5,000
Container 3: weight = 900 tonnes, profit = $20,000
Container 4: weight = 100 tonnes, profit = $5,000
In this case, it would be best to load the ship with containers 1 and 3 as that does not exceed the capacity of the ship, and yields the most profit ($30,000).
It is tempting to use a greedy approach to solving the problem, simply taking containers with the best profit until the ship is full. Unfortunately this does not guarantee an optimal solution in all cases. For example if

Ship's capacity is 1000 tonnes.
Container 1: weight = 1000 tonnes, profit = $10,000
Container 2: weight = 100 tonnes, profit = $9,000
Container 3: weight = 100 tonnes, profit = $9,000
One way of solving the problem to guarantee an optimal solution is to use a brute force search of all possible container combinations. (A less computationally expensive solution is possible using Dynamic Programming - more on that in second year CS!)

Over the next 4 weeks you are to develop an application that will solve the ship loading problem using a brute force search that is both recursive and iterative.

This prac
For this prac you should develop the File I/O section of your application, and become familiar with the problem.

The input to your application will be a text file of ship and container details in the following format.

line 1: Ship name
line 2: Ship's capacity as an integer
line 3: A pair of integers, where the first is the weight of container 1, and the second is the profit of that container.
line 4: A pair of integers, where the first is the weight of container 2, and the second is the profit of that container.
...
line x: A pair of integers, where the first is the weight of container x-2, and the second is the profit of that container.
You should read the file creating a single Ship object, and as many Container objects as required. The Container objects should be stored in an extensible list (for example an ArrayList, Vector or LinkedList) that forms a class field of a class called Solver. A skeleton Solver class is provided.

The name of the file should be passed in as a command line argument to your application. (That is, using the String args[] parameter of main()).

In subsequent pracs you will add methods to Solver for working with the Ship and list of containers you have created.