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 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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 |
---|