AdvancedAlgorithms.KnapSack.Main C# (CSharp) Метод

        private static void Main(string[] args)
        {
            int numTestCases = int.Parse(Console.ReadLine());

            for (int testCase = 0; testCase < numTestCases; testCase++)
            {
                int vehicleCapacity = int.Parse(Console.ReadLine());
                int numItems = int.Parse(Console.ReadLine());

                //parse the weights and values
                string[] weightsStrings = Console.ReadLine().Split(' ');
                string[] valuesStrings = Console.ReadLine().Split(' ');

                int[] weights = new int[numItems+1];
                int[] values = new int[numItems+1];
                for (int itemNumber = 1; itemNumber <= numItems; itemNumber++)
                    weights[itemNumber] = int.Parse(weightsStrings[itemNumber-1]);

                for (int itemNumber = 1; itemNumber <= numItems; itemNumber++)
                    values[itemNumber] = int.Parse(valuesStrings[itemNumber-1]);

                Console.WriteLine(GetMaximumValueOfLoad(vehicleCapacity, numItems, weights, values));
            }
        }