Description

 

SpongeBob is hungry while waiting bus that can take him leave this weird place. However, he doesn't have that much money to buy food from the vending machine since he needs to use it for taking the bus. Now you are the vending machine that sells kandy to SpongeBob. You always prioritizes selling the cheapest item currently available in your storage so SpongeBob won't be broken. As a machine, you have two operations:

1. store <price>: Add an item with a given price (integer) into the vending machine.

2. sell: Sell the item with the lowest price currently in the machine. If the machine is empty, ignore this command.

Please implement the functions in the code, so SpongeBob can receive kandy from you.

Constraints

• number of operations <= 2 * 10⁶.
• price <= 10⁹.

Hint: For the more efficient way to sell the cheapest kandy, you may refer to this link:

https://www.geeksforgeeks.org/dsa/introduction-to-min-heap-data-structure/

Also please note that you CANNOT use STL to solve this problem.

 

Input

A sequence of commands (store <num> or sell).

Output

A single line containing two integers separated by a space:

1. The total number of items sold.

2. The total revenue with '\n'.

Sample Input  Download

Sample Output  Download

Partial Judge Code

14927.cpp

Partial Judge Header

14927.h

Tags

Discuss