CF706B.Interesting drink

普及-

通过率:0%

时间限制:2.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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

瓦西里喜欢在辛苦工作后休息,因此你经常能在附近的一家酒吧遇见他。和其他程序员一样,他钟爱著名的饮品“Beecola”,这种饮品可以在城市中 n 家不同的商店购买。已知在第 i 家商店中,一瓶“Beecola”的价格为 x__i 枚硬币。

瓦西里计划连续 q 天购买他最喜爱的饮品。他知道,在第 i 天他最多能花费 m__i 枚硬币。现在,对于每一天,他都想知道自己能在多少家不同的商店购买一瓶“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 x__i (1 ≤ x__i ≤ 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 m__i (1 ≤ m__i ≤ 109) — the number of coins Vasiliy can spent on the i-th day.

输入的第一行包含一个整数 nn(1 ≤ n ≤ 100 0001 ≤ n ≤ 100\,000)—— 表示城市中出售瓦西里最喜爱饮料的商店数量。

第二行包含 nn 个整数 xix_i(1 ≤ xi ≤ 100 0001 ≤ x_i ≤ 100\,000)—— 表示第 ii 个商店中该饮料每瓶的价格。

第三行包含一个整数 qq(1 ≤ q ≤ 100 0001 ≤ q ≤ 100\,000)—— 表示瓦西里计划购买该饮料的天数。

接下来有 qq 行,每行包含一个整数 mim_i(1 ≤ mi ≤ 1091 ≤ m_i ≤ 10^9)—— 表示第 ii 天瓦西里可用于购买饮料的硬币数量。

输出格式

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.

输出 q 个整数。其中第 i 个整数应等于 Vasiliy 在第 i 天能够购买到该饮料的商店数量。

输入输出样例

  • 输入#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.

第一天,瓦西里无法在任何一家商店购买饮料。

第二天,瓦西里可以在第 1、2、3 和 4 号商店购买饮料。

第三天,瓦西里只能在第 1 号商店购买饮料。

最后,在最后一天,瓦西里可以在任意一家商店购买饮料。

输入解题思路,AI测评打分。不知道怎么写?

首页