Introduction - If you have any usage issues, please Google them yourself
Group queue algorithm: the establishment of a queue array contains n queues, n = 1000, set the queue is empty for all queue pointers a and b, a and b are 0 records to establish an array of n elements of the group of initialization, i = 0, indicating the current number of queue has elements read a command if it is delete command, from the first a one queue to start the search, to find the first element of a team if you delete elements after the queue is empty, a++ if it is the end of the command , output all the elements of the queue, the queue is empty, do not pay attention to the output if it is inserted command, first check from a to b in each queue have the same group element if the queue is found in the k-th element of the same group, then enter the queue if no k-th found, then insert the first b queues, b