question–>
https://practice.geeksforgeeks.org/problems/sum-of-elements-between-k1th-and-k2th-smallest-elements3133/1/?category[]=Heap&category[]=Heap&problemStatus=unsolved&difficulty[]=-1&difficulty[]=0&page=1&query=category[]HeapproblemStatusunsolveddifficulty[]-1difficulty[]0page1category[]Heap#
code–>
help not passing all testcases
Sum of elements between k1'th and k2'th smallest elements
Hello @sheikhhaji18
priority_queue<long long int,vector,greater> p;
there will be long long int here instead of int and also k1 can be greater than or equal to k2.
I hope this all is clear to you.
Feel free to ask if you still have any doubt.
Thanks.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.