Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.
 Service Time - 1
Question:
Bank Asia wants to change their current client
service numerator system. In this system, the
people will be assigned a priority according to
their own customer priority and priority according
to the operation they want to have. They are also
assigned an approximate service time, according to
operation they have.
Write a program that is going to read the
information for the currently waiting people. Then,
your program will decide waiting time for this newly
coming client.
Input specification:
In the first line, you will be given the information
for a new client. Then in the second line,
you are given an integer (n), the number of people
currently waiting in the queue where 1 ≤
n ≤ 60000. Then, each of the following n lines
contain information for a client. In every client
information line you are given
- The name of person: Names may be composed of
only English letters and several strings ending
with a semicolon ';'.
- The priority of the
client: an integer where 1 ≤ Priority ≤ 10000;
- Service time: an
integer between 0 and 50
Output specification
Show the waiting time of newly arrived client.
Note: If there are other people
in the queue with the same priority, the new client
is served after all.
| Sample Input I |
Sample Output I |
Erion Agolli; 8 4
5
Corey Cecil Hines; 6 4
Leonard Afrim Osmani; 8 9
Ervin Dervishi; 14 8
Carlos Estrada; 3 6
Anjeza Dardani; 11 5
|
22
|
Explanation: There are three
people who have higher or equal priority with the new
customer:
- It takes 9 minutes to serve Leonard Afrim Osmani.
- It takes 8 minutes to serve Ervin Dervishi.
- It takes 5 minutes to serve Anjeza Dardani
That makes 22 minutes waiting time for Erion Agolli.
Для отправки решений необходимо выполнить вход.
|