Data structures algorithm

1. Problem Description Office customer wants to improve the functioning using a system of organizing the people to stop. The Office has opened more counters, each specializing on a particular issue, but can also resolve other problems. Each counter can hold more people that are sort by priority. If a man sits at a desk and has the highest priority, it is addressed first. New desks can be opened or existing ones can be closed, in which case people are redistributed equally possible. The purpose of the theme is to make a program to simulate the required system. 2. Implementation details Every moment will be open counters N (N> = 1). Counters will be represented as a vector of length N dynamically allocated. Each stop will be assigned a double chained list representing people are waiting at the counter and which will be ordered by descending priority. If there are more people with the same priority, they will be addressed in alphabetical order. If the number of counters N changes, everyone will be arranged in a new list ordered by descending priorities or alphabetically by name, and then will be divided equally to each counter as he sees in this example. Suppose we initially open four counters (0-3), and 11 people with priorities 1 to 11, place it in the picture below 0 1 2. 3 7 10 9 11 6 5 8 4 3 2 1 Counter 0 has three people on the list, the counter 1 has 2 counter 2 has one man and counter 3 has five people in a row. If the number of counters opened changes and becomes five, then people will first sort by priority and redeployed to the new number of counters, so people with the priorities of the biggest to be the first in the list, as you can see and in the figure below: 0 1 2. 3. 4 11 10 9 8. 7 6 5 4 3 2 1