Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink "Beecola", which can be bought in n different shops in the city. It's known that the price of one bottle in the shop i is equal to xi coins.
Vasiliy plans to buy his favorite drink for q consecutive days. He knows, that on the i-th day he will be able to spent mi coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of "Beecola".
The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of shops in the city that sell Vasiliy's favourite drink.
The second line contains n integers xi (1 ≤ xi ≤ 100 000) — prices of the bottles of the drink in the i-th shop.
The third line contains a single integer q (1 ≤ q ≤ 100 000) — the number of days Vasiliy plans to buy the drink.
Then follow q lines each containing one integer mi (1 ≤ mi ≤ 109) — the number of coins Vasiliy can spent on the i-th day.
Print q integers. The i-th of them should be equal to the number of shops where Vasiliy will be able to buy a bottle of the drink on the i-th day.
5 3 10 8 6 11 4 1 10 3 11
0 4 1 5
解题思路:树状数组的模板题,利用树状数组维护相同价格酒馆的数量,对于每次查询,输出对应的sum之和即可。
代码如下:
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define EPS 1e-6
#define INF INT_MAX / 10
#define LL long long
#define MOD 100000000
#define PI acos(-1.0)
using namespace std;
const int maxn = 100005;
int bit[maxn];
int n,q,a,m;
LL sum(int pos)
{
LL s = 0;
while(pos > 0){
s += bit[pos];
pos -= pos & -pos;
}
return s;
}
void add(int pos,int val)
{
while(pos <= maxn){
bit[pos] += val;
pos += pos & -pos;
}
}
int main()
{
scanf("%d",&n);
for(int i = 1;i <= n;i++){
scanf("%d",&a);
add(a,1);
}
scanf("%d",&q);
while(q--){
scanf("%d",&m);
if(m >= maxn)
printf("%d\n",n);
else
printf("%I64d\n",sum(m));
}
return 0;
}