问题描述：设某一机器由n个部件组成，每一种部件都可以从m个不同的供应商处购得。设wij是从供应商j处购得的部件i的重量，cij是相应的价格。试设计一个算法，给出总价格不超过c的最小重量机器设计。

数据输入：由文件1.txt给出输入数据。第一行有3个正整数n,m,d。接下来的2n行，每行n个数。前n行是c，后n行是w.

结果输出：将计算的最小重量及每个部件的供应商输出到文件2.txt.

-Problem Descr iption: Let a machine composed by the n-components, each component can be different from m suppliers purchased. Set wij is purchased from suppliers of parts i j Department of weight, cij is the corresponding price. Trial design an algorithm, given the total price no more than c of the minimum weight design of the machine. Data input: the input data given by the file 1.txt. The first line has three positive integers n, m, d. The next 2n rows, n the number of each line. Before the line is n c, n, after the output line is w. The results: the calculation of the minimum weight and supplier of each component output to a file 2.txt.