Codeforces 706B 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

```5

3 10 8 6 11

4

1

10

3

11```

Output

```0

4

1

5```

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.

``` 1 #include <bits/stdc++.h>
2 using namespace std;
3 int main()
4 {
5     int a[100010];
6     int n,i,m,num;
7     while(scanf("%d",&n)!=EOF)
8     {
9         for(i=1;i<=n;i++)
10             scanf("%d",&a[i]);
11         sort(a+1,a+1+n);
12         scanf("%d",&m);
13         while(m--)
14         {
15             scanf("%d",&num);
16             if(num<a[1])
17                 printf("0\n");
18             else if(num>=a[n])
19                 printf("%d\n",n);
20             else
21             {
22                 int left=1,right=n;
23                 int mid,ans;
24                 while(left<=right)
25                 {
26                     mid=(left+right)/2;
27                     if(a[mid]<=num)
28                     {
29                         ans=mid;
30                         left=mid+1;
31                     }
32                     else right=mid-1;
33                 }
34                 printf("%d\n",ans);
35             }
36         }
37     }
38     return 0;
39 }```

0 条评论

• HDU 1013 Digital Roots【字符串，水】

Digital Roots Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/3276...

• Codeforces Round #300(A.【字符串，多方法】，B.【思维题】，C.【贪心,数学】)

A. Cutting Banner time limit per test：2 seconds memory limit per test：256 megaby...

• Code forces 719A Vitya in the Countryside

A. Vitya in the Countryside time limit per test:1 second memory limit per test:2...

• Analyze tweets in under 30 minutes using Node-RED

I created a Node-RED app in Bluemix which searches for a specified keyword, user...

• SAP Fiori里两种弹出对话框(popup dialog)设计

This blogs introduces the tips how to find the location of source code where the...

• SAP WebClient UI页面标签的决定逻辑介绍

In this blog we have discussed the logic how the correct UI view configuration i...

• ROS2机器人应用简明教程4工区

工区/工作区/工作空间（workspace简写为ws）是机器人操作系统核心概念之一。

• 仅用四行代码实现RNN文本生成模型

文本生成（generating text）对机器学习和NLP初学者来说似乎很有趣的项目之一，但也是一个非常困难的项目。值得庆幸的是，网络上有各种各样的优秀资源，...

• 提取Jar2Exe源代码，JavaAgent监控法

最近遇见一个麻烦，明明知道是java写的小软件，但是打包成了exe，木得办法，之前打包的都有缓存能在TEMP文件夹找到。这次可不一样了，特此记录一下。