Sum of elements between k1'th and k2'th smallest elements
Submissions: 7178   Accuracy:

25.16%

  Difficulty: Easy   Marks: 2

Given an array of positive integers and two positive integers K1 and K2. Find sum of all elements greater tha K1th and smaller than K2th smallest elements of array.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer N, denoting the length of the array. Next line contains N space seperated integers of the array. Third line contains two space seperated integers denoting K1th and K2th smallest elements.

Output:
For each test case, output the sum of all the elements between K1th and K2th smallest elements.

Constraints:
1 <= T <= 100
1 <= N <= 107
1 <= K1, K2 <= 1014

Example:
Input

2
7

20 8 22 4 12 10 14
3 6
6

10 2 50 12 48 13
2 6

Output:
26
73

Explanation:
Test Case 1:
3rd smallest element is 10
6th smallest element is 20
Sum of all element between K1 & K2 is 12 + 14 = 26

** For More Input/Output Examples Use 'Expected Output' option **

Author: harshitsidhwa


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.