[1] 授業単元：Cプログラミング
[2]
the shortest remaining time next (SRTN) job scheduling algorithm.
入力: 0 6
1 1
2 5
2 6
3 2
から以下の実行結果を出力するプログラムのrun_srtn関数を作成しプログラムを完成させよ。

*出力結果
Job 0 Arrival Time 0 Service Time 6
Job 1 Arrival Time 1 Service Time 1
Job 2 Arrival Time 3 Service Time 5
Job 3 Arrival Time 5 Service Time 6
Job 4 Arrival Time 8 Service Time 2

--- Scheduling Statistics ---
JOB # Arr Fin Svc TA
0 0 7 6 7
1 1 2 1 1
2 3 14 5 11
3 5 20 6 15
4 8 10 2 2
*{arr= arrival time, Fin = finish time,Svc =service time,TA= turn around time(finish-arrival_time)}