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 smallest elements in the subarray A[L...R] where K = [1, R-L+1]. Thanks in advance :)
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
Sum of K smallest element in range queries.
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 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) |
Name |
---|