| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Sum of K smallest element in range queries.
Hi code forces, I have been getting haunted by this problem for a long time now.
Would you please help me to understand what data structure and approach are needed to solve this problem? This problem is not from any live contest.
Given an array A having N integers in the range [-1e8, 1e8] and Q queries each having 3 integers [L, R, K]. For each query, the task is to return the sum of K's smallest elements in the subarray A[L...R] where K = [1, R-L+1].
Thanks in advance :)
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
Sanjit-OP | 2022-05-25 14:05:17 | 496 | Tiny change: 'und search).\n\nTime' -> 'und search in each node).\n\nTime' | |
| en3 |
|
Sanjit-OP | 2022-05-25 10:38:11 | 445 | Tiny change: ' log(N) = Segment tre' -> ' log(N) = Iterating over segment tre' | |
| en2 |
|
Sanjit-OP | 2022-05-25 10:30:43 | 277 | ||
| en1 |
|
Sanjit-OP | 2022-05-25 09:35:24 | 288 | Initial revision (published) |
