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
On the first day, Vasiliy won't be able to buy a drink in any of the shops.
On the second day, Vasiliy can buy a drink in the shops 1, 2, 3 and 4.
On the third day, Vasiliy can buy a drink only in the shop number 1.
Finally, on the last day Vasiliy can buy a drink in any shop.
题意:n (1 ≤ n ≤ 100 000)个商店卖一个东西,每个商店的价格xi,你有q(1≤m≤100 000)天,每天有m的钱,问每天可以付的起的商店数。
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100000 + 10;
int n;
int x[maxn];
int q;
int m;
int main()
{
while (scanf("%d", &n) != EOF){
for (int i = 0; i < n; i++){
scanf("%d", &x[i]);
}
sort(x, x + n);
scanf("%d", &q);
for (int i = 0; i < q; i++){
scanf("%d", &m);
int l = 0, r = n - 1;
while (l <= r){ //二分
int mid = (l + r) / 2;
if (m >= x[mid])
l = mid + 1;
else
r = mid - 1;
}
printf("%d\n", l);
}
}
return 0;
}