Problemintro
Top M items of a large stream
Also called TopM.
Finds the M largest items among N inputs arriving as a stream, using a priority queue of size M.
Finds the M largest items among N inputs arriving as a stream, using a priority queue of size M.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag E9SF0P Edit this page History Report an error