Interesting drink

题意翻译

瓦西里喜欢喝"Beecola"饮料。 卖这种饮料的商铺有x家。每家的价格是x[i]元。 现在瓦西里 要买这种饮料n次，每次他最多能花n[i]元， 求他每次能在几个商铺买到至少一瓶饮料。 简短版：给出一个长度为x的数组，有n次询问， 输出 第n次询问的数大于等于几个x数组里的元素。 输入：第一行一个正整数x，表示商铺的数量。 第二行x个正整数，x[i]，表示每家商铺中饮料的价格 第三行一个正整数n，表示询问的次数。 之后n行，每行一个正整数n[i],表示最多能花多少钱 输出：n行，每行一个正整数，表示每次能去几家商铺买到饮料

题目描述

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 $ x_{i} $ 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 $ m_{i} $ 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<=100000 $ ) — the number of shops in the city that sell Vasiliy's favourite drink. The second line contains $ n $ integers $ x_{i} $ ( $ 1<=x_{i}<=100000 $ ) — prices of the bottles of the drink in the $ i $ -th shop. The third line contains a single integer $ q $ ( $ 1<=q<=100000 $ ) — the number of days Vasiliy plans to buy the drink. Then follow $ q $ lines each containing one integer $ m_{i} $ ( $ 1<=m_{i}<=10^{9} $ ) — 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.

输入输出样例

输入样例 #1

5
3 10 8 6 11
4
1
10
3
11

输出样例 #1

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.