ГлавнаяСборникиТурнирыРазделыФорумыУчастникиПечатьПомощьО системе

Турниры > CEN303 2013-15 Questions > задача:


14-Fall1-20. 50750 - Service Time - 2

CEN303 2013-15 Questions

Старт: 15.дек.2013 в 14:00:00
Финиш: 15.дек.2013 в 19:00:00
Турнир завершён!
• Турнирная таблица

Гость
• Вопросы к жюри (1)

Задачи турнира

• 51000 - Book Index
• 50531 - File Decryption
• 50464 - From Tirana to Durres
• 13-Fall2-10. 50411 - Sum of the Lea...
• 13-Fall2-20. 50687 - Pascal Triangle - 2
• 13-Fall2-40. 50753 - Average of the...
• 13-Fall2-50. 50686 - The Container
• 14-Fall1-10. 50740 - Service Time - 1
• 14-Fall1-20. 50750 - Service T...
• 14-Fall1-30. 50771 - BST Level Sum
• 14-Fall1-40. 50683 - Te Parkojme A...
• 14-Fall1-50. 50770 - Average Depth
• 14-Fall1-60. 50784 - Top Growing C...
• 14-Fall2-10. 50751 - The biggest Mi...
• 14-Fall2-20. 50794 - Writing Files Int...
• 14-Fall2-30. 50490 - Across the River
• 14-Fall2-40. 50772 - The Path of a N...

Обратная связь

Если у вас есть предложения или пожелания по работе Contester, посетите форум сайта www.contester.ru.

Лимит времени 4000/4000/4000/4000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
Question by Ibrahim Mesecan.

Serving Time - 2

Question: Bank Asia wants to change their client serving numerator system. In this new system, the people will be assigned a priority according to their own client priority and priority according to the operation they want to have. They are also assigned an approximate serving 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 find out the total waiting time for new arrived clients (including their own service time).

Input specification: In the first line, you are given an integer (n), the number of people currently waiting in the queue where 1 ≤ n ≤ 50000. 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;
  • Serving time: an integer between 0 and 50
After that, you are given another integer (m) the number of new of newly arrived clients where 1 ≤ m ≤ 25000. Each of the following m lines contain information of a new client.

Output specification
Show the total waiting time for all new clients.
Note: The highest priority person is served first. If two people have the same priority, then, the person who has less service time is served first. If they have same priority and same service time, then they are served in ascending name order.

 Sample Input I     Sample Output I   
 5
 Corey Cecil Hines; 6 4
 Leonard Afrim Osmani; 8 9
 Ervin Dervishi; 14 8
 Carlos Estrada; 3 6
 Anjeza Dardani; 11 5
 2
 Erion Aurini; 8 4
 Sami Agolli; 11 5
 40

Explanation: There are two people who have higher or equal priority with Sami Agolli:

  • It takes 8 minutes to serve Ervin Dervishi.
  • It takes 5 minutes to serve Anjeza Dardani
  • It takes 5 minutes to serve for himself
That makes 18 minutes waiting time for Sami Agolli.

Similarly Mr. Aurini waits for the same people, plus

  • and, it takes 4 minutes to serve for himself.
That makes 22 minutes waiting time for Mr. Aurini. Then, the total waiting time is 22+18=40 minutes for all new clients.
Для отправки решений необходимо выполнить вход.

www.contester.ru