| Time Limit | $1$ 秒/Second(s) | Memory Limit | $512$ 兆字节/Megabyte(s) |
| 提交总数 | $261$ | 正确数量 | $394$ | "
| 裁判形式 | 标准裁判/Standard Judge | 我的状态 | 尚未尝试 |
| 难度 | 分类标签 | STL |
Priority Queue
Priority queue is a container of elements which the element with the highest priority should be extracted first.
For n priority queues Qi (i=0,1,...,n−1) of integers, perform a sequence of the following operations.
insert(t, x): Insert x to Qt.
getMax(t): Report the maximum value in Qt. If Qt is empty, do nothing.
deleteMax(t): Delete the maximum element from Qt. If Qt is empty, do nothing.
In the initial state, all queues are empty.
The input is given in the following format.
n q
query1
query2
:
queryq
Each query queryi is given by 0 t x or 1 t or 2 t where the first digits 0, 1 and 2 represent insert, getMax and deleteMax operations respectively. 1≤n≤1,000 1≤q≤200,000 −1,000,000,000≤x≤1,000,000,000
2 10
0 0 3
0 0 9
0 0 1
1 0
2 0
1 0
0 0 4
1 0
0 1 8
1 1
9
3
4
8
| 本题记录 | 用 户（点击查看用户） | 运行号（点击购买题解） | 时 间 |
|---|---|---|---|
| 算法最快[$0 $ms] | 哎哎 | 823624 | 2022-03-20 19:15:44 |
| 内存最少[$1856 $KB] | Qiqy | 608876 | 2020-07-29 16:00:34 |
| 第一AC | 计爱玲 | 281527 | 2018-10-07 09:11:09 |
| 第一挑战 | 计爱玲 | 281527 | 2018-10-07 09:11:09 |
| 竞赛编号 | 竞赛名称 | 竞赛时间 | 访问比赛 |
|---|---|---|---|
| 1798 | 2023-2024-2学期<计算机专业竞赛实训> 第2周练习：STL容器基础数据结构应用【22计算机】 | 2024-03-04 00:00:00 | 请登录 |
| 1738 | 2022-2023-2学期<计算机专业竞赛实训> 第4周练习：STL容器与数据结构应用【21计算机12345】 | 2023-03-13 00:00:00 | 请登录 |
| 1680 | 2021-2022-2学期<算法分析与设计> 第1周练习：STL容器1：vetor/list/queue/deque/sort | 2022-02-21 08:00:00 | 请登录 |