Lengths of programs sorted according to increasing lengths . This is the order in which the programs have to be stored on tape for minimum MRT
cout << " Optimal ▁ order ▁ in ▁ which ▁ programs ▁ are ▁ to ▁ be " " stored ▁ is : ▁ " ; for ( int i = 0 ; i < n ; i ++ ) cout << L [ i ] << " ▁ " ; cout << endl ;