Team Queue Uva 540

Problem: Uva 540
I find that this problem is interesting. When we discuss about queue, it's not always strict queue rule that we have in mind. Sometimes people can just cut the line because they know someone in the line.

The idea of solving is using list of queue.

1. Each time an element comes, check each list member which is a queue.
2. If the queue.front() 's team is the same with the new element, just push it to the queue
3. else check other member of the list
4. if there is no element with the same team, create new queue in the back of the list

Here's my code.