please write in C++ or Java

SAMPLE INPUT

MPL 1 JOB 1 CORE 50 DISK 10 CORE 150 DISK 0 CORE 100 DISK 0 CORE 150 DISK 0 CORE 100 DISK 0 CORE 210 DISK 9 CORE 220 DISK 9 CORE 200 DISK 9 CORE 30 DISK 9 CORE 30 DISK 9 CORE 30 DISK 8 CORE 20 DISK 8 CORE 40 PRINT 400 CORE 200 PRINT 500 CORE 10 DISK 9 CORE 30 JOB 2 CORE 50 DISK 10 CORE 150 DISK 0 CORE 100 DISK 0 CORE 150 DISK 0 CORE 100 DISK 0 CORE 210 DISK 11 CORE 220 DISK 8 CORE 200 DISK 9 CORE 30 DISK 8 CORE 30 DISK 7 CORE 80 DISK 8 CORE 70 DISK 7 CORE 30 DISK 8 CORE 20 DISK 8 CORE 60 PRINT 600 CORE 200 PRINT 200 CORE 80 DISK 9 CORE 10 DISK 9 CORE 10 DISK 9 CORE 30 JOB 3 CORE 50 DISK 10 CORE 100 DISK 0 CORE 150 DISK 0 CORE 100 DISK 0 CORE 70 DISK 9 CORE 90 DISK 9 CORE 200 DISK 9 CORE 30 DISK 9 CORE 30 DISK 9 CORE 30 DISK 8 CORE 20 DISK 8 CORE 40 PRINT 400 CORE 200 PRINT 500 CORE 10 DISK 9 CORE 30 JOB 4 CORE 50 DISK 10 CORE 150 DISK 0 CORE 100 DISK 0 CORE 150 DISK 0 CORE 100 DISK 0 CORE 150 DISK 0 CORE 100 DISK 0 CORE 210 DISK 11 CORE 320 DISK 8 CORE 600 DISK 8 CORE 400 DISK 9 CORE 30 DISK 8 CORE 30 DISK 7 CORE 40 DISK 8 CORE 20 DISK 7 CORE 60 DISK 8 CORE 20 DISK 8 CORE 60 PRINT 500 CORE 20 PRINT 200 CORE 30 DISK 9 CORE 20 DISK 9 CORE 20 DISK 7 CORE 20

1 0 DISK 7 20 1. OBJECTIVE The Spooler Queue: Your program should have a single This assignment will introduce you to job scheduling. spooler queue holding all jobs waiting for the print spooler and manage it in strict first come first served (FCFS) order. 2. SPECIFICATIONS Program Organization: Your program should read its input Until the mid-seventies, most computers performed batch file name though input redirection as in: processing. There were fed batches of jobs to be processed ./a.out > code >> parameter; go through a single disk queue that your program should manage in strict first come first served (FCFS) order. Recall that both scanf and cin return zero when the end of the input is reached. JOB CORE 3 30 1 0 DISK 7 20 1. OBJECTIVE The Spooler Queue: Your program should have a single This assignment will introduce you to job scheduling. spooler queue holding all jobs waiting for the print spooler and manage it in strict first come first served (FCFS) order. 2. SPECIFICATIONS Program Organization: Your program should read its input Until the mid-seventies, most computers performed batch file name though input redirection as in: processing. There were fed batches of jobs to be processed ./a.out > code >> parameter; go through a single disk queue that your program should manage in strict first come first served (FCFS) order. Recall that both scanf and cin return zero when the end of the input is reached. JOB CORE 3 30