Accepted rate : 19人/25人 ( 76% ) [非即時]
評分方式：
最近更新 : 2022-08-08 13:36
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".
Vasiliy 喜歡在辛苦工作後休息，所以您可能經常在附近的某個酒吧遇到他。 和所有程序員一樣，他喜歡著名的飲料“Beecola”，這種飲料可以在城裡的 n 家不同的商店買到。 已知店鋪 i 一瓶的價格等於 xi 幣。
Vasiliy 計劃連續 q 天購買他最喜歡的飲料。 他知道，在第 i 天他將能夠花費 mi 幣。 現在，他每天都想知道他可以在多少家不同的商店買到一瓶“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.
輸入的第一行包含一個整數 n (1 ≤ n ≤ 100 000) — 城市中出售 Vasiliy 最喜歡的飲料的商店數量。
第二行包含 n 個整數 xi (1 ≤ xi ≤ 100 000)——第 i 家商店的飲料瓶價格。
第三行包含一個整數 q (1 ≤ q ≤ 100 000) — Vasiliy 計劃購買飲料的天數。
然後遵循 q 行，每行包含一個整數 mi (1 ≤ mi ≤ 109) — Vasiliy 在第 i 天可以花費的硬幣數量。
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 個應該等於第 i 天 Vasiliy 能夠購買一瓶飲料的商店數量。
5 3 10 8 6 11 4 1 10 3 11
0 4 1 5
公開 測資點#0 (4%): 0.4s , <1M
公開 測資點#1 (4%): 0.4s , <1M
公開 測資點#2 (4%): 0.4s , <1M
公開 測資點#3 (4%): 0.4s , <1M
公開 測資點#4 (4%): 0.4s , <1M
公開 測資點#5 (4%): 0.4s , <1M
公開 測資點#6 (4%): 0.4s , <1M
公開 測資點#7 (4%): 0.4s , <1M
公開 測資點#8 (4%): 0.4s , <1M
公開 測資點#9 (4%): 0.4s , <1M
公開 測資點#10 (4%): 0.4s , <1M
公開 測資點#11 (4%): 0.4s , <1M
公開 測資點#12 (4%): 0.4s , <1M
公開 測資點#13 (4%): 0.4s , <1M
公開 測資點#14 (4%): 0.4s , <1M
公開 測資點#15 (4%): 0.4s , <1M
公開 測資點#16 (4%): 0.4s , <1M
公開 測資點#17 (4%): 0.4s , <1M
公開 測資點#18 (4%): 0.4s , <1M
公開 測資點#19 (4%): 0.4s , <1M
公開 測資點#20 (4%): 0.4s , <1M
公開 測資點#21 (4%): 0.4s , <1M
公開 測資點#22 (4%): 0.4s , <1M
公開 測資點#23 (4%): 0.4s , <1M
公開 測資點#24 (4%): 0.4s , <1M
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.
第一天，瓦西里在任何一家商店都買不到飲料。
第二天，Vasiliy 可以在商店 1、2、3 和 4 購買飲料。
第三天，瓦西里只能在 1 號商店買飲料。
最後，在最後一天 Vasiliy 可以在任何商店購買飲料。
| ID | User | Problem | Subject | Hit | Post Date |
沒有發現任何「解題報告」 |
|||||