Can you please point me to some practice prolems ( on any Online judge) on "K nearest points to origin" It is one time query, But also how can I solve if it's for multiple queries ?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3898 |
| 2 | tourist | 3840 |
| 3 | orzdevinwang | 3706 |
| 4 | ksun48 | 3691 |
| 5 | jqdai0815 | 3682 |
| 6 | ecnerwala | 3525 |
| 7 | gamegame | 3477 |
| 8 | Benq | 3468 |
| 9 | Ormlis | 3381 |
| 10 | maroonrk | 3379 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | Dominater069 | 161 |
| 4 | Um_nik | 160 |
| 5 | atcoder_official | 159 |
| 6 | djm03178 | 157 |
| 7 | adamant | 153 |
| 8 | luogu_official | 151 |
| 9 | awoo | 149 |
| 10 | TheScrasse | 146 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/31/2025 15:29:16 (l2).
Desktop version, switch to mobile version.
Supported by
Can you expound on what kind of problem is "K nearest points to origin" and your algorithm variant? Is it a one-time kind of query?
I have updated the question, Basically I am trying KD-Tree instead of Heap. http://pointclouds.org/documentation/tutorials/kdtree_search.php
It's not nearest points to origin, but I have some closest pair problems.