Order book Yuriy Lyfenko

Simulate a sell-side order book and calculate the cost of a final purchase as fast as possible.

Input

1,000,000 order updates on STDIN, one per line:

  • + <price> <size> – add a new sell order
  • - <position> – delete the order at the given position
  • = <size> – buy <size> shares from the top of the order book

After all updates are processed, buy 1,000 shares from the top of the order book.

Output

Print the total cost of the final 1,000-share purchase to STDOUT.

Order Book Rules

Orders are sorted by price ascending (lower is better). Orders at the same price are sorted by arrival time (earlier first). Position 0 is the best (lowest-price) offer.

The = (buy) operation consumes shares starting from position 0. If an order is fully consumed, it is removed from the book.

Example

Input Order book state
+ 1137 100 (1137,100)
+ 1130 10 (1130,10), (1137,100)
+ 1130 50 (1130,10), (1130,50), (1137,100)
- 0 (1130,50), (1137,100)
+ 1150 200 (1130,50), (1137,100), (1150,200)
= 200 (1150,150)

Total cost of the last buy: 50 * 1130 + 100 * 1137 + 50 * 1150.

Date AuthorLanguageStatus Score
Nov 21, 2021 22:04Yuriy LyfenkoYuriy LyfenkoCPPg++9.3.0Success1,737,638+0.02 RP
Nov 21, 2021 21:59Yuriy LyfenkoYuriy LyfenkoCPPg++9.3.0Success1,740,944
Nov 21, 2021 21:58Yuriy LyfenkoYuriy LyfenkoCPPclang++10.0.0Success1,740,547
Nov 21, 2021 21:56Yuriy LyfenkoYuriy LyfenkoCPPg++9.3.0Success1,739,186+2.66 RP
Nov 21, 2021 21:55Yuriy LyfenkoYuriy LyfenkoCPPg++9.3.0Error
Nov 21, 2021 21:21Yuriy LyfenkoYuriy LyfenkoCPPg++9.3.0Success2,262,969
Nov 21, 2021 21:21Yuriy LyfenkoYuriy LyfenkoCPPclang++10.0.0Success2,357,619
Nov 21, 2021 21:21Yuriy LyfenkoYuriy LyfenkoCPPg++9.3.0Success2,276,296
Nov 21, 2021 21:19Yuriy LyfenkoYuriy LyfenkoCPPg++9.3.0Success2,264,571+4.42 RP