#i need solution faster please in c++ or c #

# use queue data structure #

assume the processor has many processes that are needed to be processed in the same time , each process needs a time to finished , so the processor puts them in the ordered queue such that the process with minimum time comes first in front of the queue .i.e the processor should serve the fewest time firstly. 1. write a function to insert a process , in its proper place.(make sorting for queue) 2. write a function to find the total working time of the processor.(time to make sorting for queue)