Задача о рюкзаке

package knapsack2;
 
import java.util.*;
 
class Knapsack2
{
public static void main (String args[]) // entry point from OS
{
MyClass myClass; // create dynamic entry point
myClass = new MyClass(new Scanner(System.in));
}
}
 
class MyClass {
 
MyClass (Scanner s)
{
Scanner ll;
int id;
Scanner ls;
int B[][];
int numItems, maxWeight, w, k;
int weight[], cost[];
int remainingWeight;
 
//*** Read in the initial numItems, maxWeight pair
ll = new Scanner(s.nextLine());
id = ll.nextInt();
 
ls = new Scanner(s.nextLine());
numItems = ls.nextInt();
maxWeight = ls.nextInt();
 
while ( (numItems != 0) && (maxWeight != 0) )
{
// *** Read in all the data for the items
cost = new int [numItems+1];
weight = new int [numItems+1];
ls = new Scanner(s.nextLine());
for (k = 1; k <= numItems; k++)
{
weight [k] = ls.nextInt();
cost [k] = ls.nextInt();
}
long lBegin = System.currentTimeMillis();
// *** initialize
B = new int [numItems+1][maxWeight+1];
for (w = 0; w <= maxWeight; w++)
B[0][w] = 0;
 
// *** Now do the work!
for (k = 1; k <= numItems; k++)
{
for (w = maxWeight; w >= weight[k]; w--)
if (cost[k] + B[k-1][w-weight[k]] > B[k-1][w])
B[k][w] = cost[k] + B[k-1][w-weight[k]];
else
B[k][w] = B[k-1][w];
for (w = 0; w < weight[k]; w++)
B[k][w] = B[k-1][w];
}
 
// *** Print out the results.
System.out.println("ID #" + id);
System.out.println("Max cost = " + B[numItems][maxWeight]);
System.out.print("Items used:");
for (k = numItems, remainingWeight=maxWeight; k > 0; k--)
{
if (remainingWeight >= weight[k])
if ( B[k][remainingWeight] == (cost[k] + B[k-1][remainingWeight - weight[k]]) )
{
System.out.print(" " + k);
remainingWeight -= weight[k];
}
}
System.out.println();
System.out.println();
 
// *** Read in the next numItems, maxWeight pair
ll = new Scanner(s.nextLine());
id = ll.nextInt();
 
ls = new Scanner(s.nextLine());
numItems = ls.nextInt();
maxWeight = ls.nextInt();
 
long lEnd = System.currentTimeMillis();
long lDelta = lEnd - lBegin;
}
 
}
 
} //** end of the "MyClass" class

String str = "";
String [] arrayStr = null;
 
while(s.hasNext()){
str = s.nextLine();
arrayStr = str.split(" ");
id =  = Integer.parseInt(arrayStr[0]);
numItems = Integer.parseInt(arrayStr[1]);
maxWeight = Integer.parseInt(arrayStr[2]);
 
cost = new int[numItems + 1];
weight = new int[numItems + 1];
w = 0; //начинаем заполнять массивы с нуля
k = 0;
 
for(int i = 3; i<arrayStr.length-1; i++){
cost[w++] = Integer.parseInt(arrayStr[i]); // массив содержащий цену
weight[k++] = Integer.parseInt(arrayStr[i+1]);