有N件工作，输入每件工作的费时、最后完成的期限及工作的价值，试求可能的一个完成工作序列，使价值和最大。(There are N pieces of work, input each piece of work time, the deadline and the value of the work, try to find a possible completion of the work sequence, so that the value and maximum.)