Codeforces #367 B. Interesting drink（二分）

B. Interesting drink

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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".

Input

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.

Output

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.

Example

input

53 10 8 6 114110311

output

0415

Note

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.

#include<cstdio>#include<cstring>#include<algorithm>#define N 100005using namespace std;int n,m;int a[N];int l,r,mid;int main(){scanf("%d",&n);for(int i=0;i<n;i++)   scanf("%d",&a[i]);sort(a,a+n);scanf("%d",&m);while(m--){int b;l=0;r=n-1;int ans=0,flag=0;scanf("%d",&b);if(b<a[l])printf("0\n");else if(b>=a[r])printf("%d\n",n);else {while(l<=r){mid=(l+r)/2;if(a[mid]>b){     r=mid-1;}else l=mid+1;}printf("%d\n",l);}}return 0;}

#include<cstdio>#include<cstring>#include<algorithm>#define N 100005using namespace std;int a[N];int main(){int n,m;scanf("%d",&n);for(int i=0;i<n;i++)   scanf("%d",&a[i]);sort(a,a+n);scanf("%d",&m);while(m--){int b;scanf("%d",&b);        int ans=upper_bound(a,a+n,b)-a;   printf("%d\n",ans);}return 0;}