[HELP] Sum of K-largest numbers in a range (using Merge Sort Tree?)

Revision en1, by Aritra741, 2020-09-06 09:37:18

I was wondering if it's possible to use Merge Sort Tree to find out the sum of K-largest numbers in a range. I've seen people solve it using Wavelet tree and Persistent Segment Tree. I failed to implement Merge Sort Tree in such a way that it solves the given task and now wondering if it's possible to do so.

Tags #data structures, #merge sort tree

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Aritra741 2020-09-06 09:37:18 392 Initial revision (published)