Problemadvanced
Top-k query problem
Also called top-k selection over aggregated scores.
Return the k objects with highest aggregate score over sorted lists.
Return the k objects with highest aggregate score over sorted lists.
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 CPM00E Edit this page History Report an error