Solution for knapsack problem
Solution uses simple greedy algorithm to load up to 75% of capacity and then calculates DP by weights for window.
Also has FPTAS (Ibarra-Kim) method implemented.
Can read data from file or std:istream Can write answer to file either std:ostream