利用动态规划算法实现0-1背包问题，要求测试数据以文本文件的形式存储，即所有的数据由文本文件读入。-Implementation of 0-1 knapsack problem using dynamic programming algorithm, test data are stored as text files, that all of the data from text file to read.