By Dynamic Programming

#include <cmath>
#include <iostream>
#include <algorithm>
#include <fstream>

std::ifstream FileIn("Task.txt");

int dynamicAlgorithm(int* arrayOfCost, int* arrayOfWeight, int numberOfItem, int maxWeight) {
    int** array = new int*[numberOfItem];
    for (size_t i = 0; i < numberOfItem; ++i) {
        array[i] = new int[maxWeight];
    }

    for (size_t j = 0; j < maxWeight; ++j) {
            array[0][j] = 0;
    }

    for (size_t i = 0; i < numberOfItem; ++i) {
        for (size_t j = 0; j < maxWeight; ++j) {
            if (i > 0) {
                if (j - arrayOfWeight[i] >= 0) {
                    array[i][j] = std::max(arrayOfCost[i] + array[i - 1][j - arrayOfWeight[i]], array[i - 1][j]);
                }
                else {
                    array[i][j] = array[i - 1][j];
                }
            }
            else if (j >= arrayOfWeight[i]) {
                array[i][j] = arrayOfCost[i];
            }
        }
    }


    int result = array[numberOfItem - 1][maxWeight - 1];

    for (size_t i = 0; i < numberOfItem; ++i) {
        delete[] array[i];
    }
    delete[] array;

    return result;
}


int main() {
    int maxWeight = 0, numberOfItem = 0;

    FileIn >> numberOfItem >> maxWeight;

    int* arrayOfWeight = new int[numberOfItem];
    int* arrayOfCost = new int[numberOfItem];

    for (size_t i = 0; i < numberOfItem; ++i) {
        FileIn >> arrayOfWeight[i];
    }
    for (size_t i = 0; i < numberOfItem; ++i) {
        FileIn >> arrayOfCost[i];
    }
    std::cout << "Max cost is " << dynamicAlgorithm(arrayOfCost, arrayOfWeight, numberOfItem, maxWeight);

    delete[] arrayOfCost;
    delete[] arrayOfWeight;
    return 0;
}