要求 有N件工作，输入每件工作的费时、最后完成的期限及工作的价值，试求可能的一个完成工作序列，使价值和最大。-N pieces of work required, enter the time-consuming work of each, the value of the last completed period and work, find a complete job sequence possible, so that the value and the maximum.