Job Sequence with $2$ machine

$\backslash$table$[[$Job$,1,2,3,4,5],[$A$,5,1,9,3,10],[$B$,2,6,7,8,4]]$

Optimal job sequence

$\backslash$table$[[2,4,3,5,1],[$A$,,,,],[,,,,]]$

$24351$

$\backslash$table$[[$Job$,$Machine A$,$Machine B$,$Idle time$],[$In$,$Out,In$,$Out,A$,$B$],[2,0,0+1=1,1,1+6=7,,1],[4,1,1+3=4,7,7+8=15,,],[3,4,4+9=13,15,15+7=22,,1],[5,13,13+10=23,23,23+4=27,,1],[1,23,23+5=28,28,28+2=30,2,],[\backslash$table$[[$Idle time for machine $A=2$ hours$],[$Idle time for machine $B=3$ hours$],[$Total Idle Time $=5$ hours$],[$Total Elapsed Time $=30$ hours$]]]]$

$16$

Based on this subject $,$ write a code with cpp language to setup this problem