|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||0||0||0||0.000%|
Your team is setting up a computing resource devoted to batch processing of compute-bound jobs. In addition, you have decided to use static scheduling for each period of time. Naturally, you wish to maximize the income for each set of jobs run, and you have been given the responsibility of finding an optimal mix of jobs for each set of candidate jobs. The jobs are submitted by an open bid process: clients will specify the amount of processor time they wish to reserve and the dollar amount that they wish to pay. If a job finishes early, the client will still pay the full amount, and if a job exceeds the requested time, it will be terminated and (of course) the client will still pay the full amount. For purposes of scheduling, your team assumes that each job will in fact use its entire scheduled time slot. In the interests of good customer relations, though, you are not to include a bid in the schedule if there is not sufficient time available to satisfy it — we’re not going to over-book like the airlines do, and then hope someone doesn’t use the full allotment!
The input file begins with a line containing a single integer (no white space) specifying the number of problem sets in the file.
Each problem set consists of (n+2) lines (no white space except as specified):
Each problem set will be numbered (beginning at one) and will generate a single line:
Problem <k>: <t> seconds scheduled for $abc.de
where <k> is replaced by the problem set number, <t> is replaced with the total time actually scheduled (possibly not the full input time), and $abc.de is replaced by the dollar amount, given always with the leading currency symbol and with two digits to the right of the decimal point. There will be no blank lines, and the final line will end with the new-line character.
1 10 19 0.78 12 0.31 17 0.77 22 0.77 8 0.56 10 0.33 17 0.35 24 0.12 22 0.70 5 0.52 120
Problem 1: 120 seconds scheduled for $4.78