Codeforces 706B：Interesting drink（二分+排序）

最新推荐文章于 2019-04-25 19:16:16 发布

原创最新推荐文章于 2019-04-25 19:16:16 发布 · 538 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#排序 #二分

二分同时被 2 个专栏收录

23 篇文章

订阅专栏

排序

1 篇文章

订阅专栏

本文介绍了一种通过排序和二分查找解决特定购物问题的方法。具体为：根据不同的商店饮料价格及每日预算，快速计算出在哪些商店可以购买到饮料。

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.

题目大意：同一种饮料，在不同商店卖的价格不同，现在给出你各个商店该饮料的价格，然后给你现在所拥有的钱数，问你能去哪家买到一瓶这饮料。

解题思路：排序后二分查找，找到比现在钱数多的那个商店的地址，然后减去首地址就行了。

代码如下：

#include <cstdio>
#include <algorithm>
using namespace std;
int a[100010];
int tmp;
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	sort(a+1,a+1+n);//记得排序 
	int q;
	scanf("%d",&q);
	for(int i=0;i<q;i++)
	{
		scanf("%d",&tmp);
		int ans=upper_bound(a+1,a+1+n,tmp)-(a+1);//注意这里首地址是a+1，当upper_bound在集合里找不到合适的值时会返回末地址后面的一位地址 
		printf("%d\n",ans);
	}
	return 0;
}