SGIFT - Sabbir and gifts

Sabbir is a little boy. he went to a gift shop with his mother. There were n different types of gifts in the shop. All the gifts were attractive to Sabbir. He wanted to buy all the gifts which are in price range a <= p <= b. You are given prices of all the gifts and a, b. Sabbir's mother need your help. Please calculate the total amount of price of all gifts of that range for Sabbir's mother.

Input

In the first line there will be n, the number of gifts in the shop.

In the next line there will be n integers p1, p2, p3 ... pn denoting price of every gift.

In the third line there will be Q, the number of queries.

The next Q lines contain two integers a and b.

Constraints

1 <= n <= 105.

1 <= pi <= 109.

1 <= Q <= 105.

1 <= a, b <= 109.

Output

Print Q lines. Every line contains one integer, sum of all prices for that range given in the query.

Example

Input:
7
1 3 2 1 5 2 2
4
1 2
1 5
3 5
4 5

Output:
8
16
8
5

NOTE: for first query, Sabbir will buy all the gifts of prices 1, 2, 1, 2, 2. So, sum is 8.

For second query, Sabbir will buy all the gifts, so the sum is 16.


Added by:sabbir
Date:2017-02-26
Time limit:0.400s-0.800s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All

hide comments
2024-11-03 18:21:12
if you're here to learn fenwick tree, don't use it as an replacement for prefix sum, try searching coordinate compression(honestly, just use unordered_map in place of vector or array and keep n = 1e9 + 5 and you're good)
2020-08-16 16:37:55
Good problem. Solved using multiset and prefix sum.
2020-02-18 18:41:11
Did it using coordinate compression nd prefix array.
2019-05-28 16:03:39
Did anyone solve using Fenwick Tree? I am getting WA for few cases
2019-04-28 21:01:22
Nice problem @sabbir vai
2018-12-13 19:01:21
Prefix sum + binary search! : )
2018-01-26 16:54:08
I sorted using python's built in sort method that sorts in O(n logn), then I used binary search for finding the lower bound, then again for finding the upper bound. Doing a sum(lower-bound, upper-bound) makes the whole solution into O(n) which is maybe why I am getting a TLE. Is that what I am not doing right here? How can I do the sum in less than O(n) in this case?
2017-12-11 20:10:37
Time limit is too strict for JAVA .
Complexity of my algorithm is (O(q*log(n))) still giving TLE.
2017-10-13 18:18:18
I hardly sympathize with the bloatware called Java but the time limit here does make it a I/O challenge. O((n+q)*logn) in Python TLEs unless the code looks like a golfing solution. This shouldn't be necessary for AC.
2017-09-11 15:13:07 testing java
What's the point of so strict time limit? I try to solve it in java, and because of time limits I do not know whether there is something wrong with algorithmic part of my code or I got TLE simply because my io isn't fast enough. It slightly spoils fun from solving problems

Last edit: 2017-09-11 15:46:33
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.