利用退火算法解决最优化问题，如最多带物品的质量为M，每件物品的质量为mi，价格为yi，怎么做才能带走价值最多的物品？(Annealing algorithm to solve the optimization problem, such as the maximum quality of goods with M, the quality of each item is Mi, the price is Yi, how to do to take away the most valuable items?)