CodeForces 706B (二分)

原创 2016年08月28日 15:01:51
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 123 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.

题意:n (1 ≤ n ≤ 100 000)个商店卖一个东西,每个商店的价格xi,你有q(1≤m≤100 000)天,每天有m的钱,问每天可以付的起的商店数。

#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100000 + 10;
int n;
int x[maxn];
int q;
int m;
int main()
{
    while (scanf("%d", &n) != EOF){
        for (int i = 0; i < n; i++){
            scanf("%d", &x[i]);
        }
        sort(x, x + n);
        scanf("%d", &q);
        for (int i = 0; i < q; i++){
            scanf("%d", &m);
            int l = 0, r = n - 1;
            while (l <= r){   //二分
                int mid = (l + r) / 2;
                if (m >= x[mid])
                    l = mid + 1;
                else
                    r = mid - 1;
            }
            printf("%d\n", l);
        }
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

CodeForces 706B Interesting drink

B. Interesting drink time limit per test 2 seconds memory limit per test 256 megabytes ...
  • yao1373446012
  • yao1373446012
  • 2016年08月12日 09:24
  • 720

Codeforces 706B Interesting drink 【二分】

Interesting drink time limit per test 2 seconds memory limit per test 256 megabytes ...
  • lututu123
  • lututu123
  • 2016年08月18日 09:11
  • 252

codeforces 706B B. Interesting drink (二分)

B. Interesting drink time limit per test 2 seconds memory limit per test 256 megabytes input s...
  • bmicnj
  • bmicnj
  • 2016年08月12日 21:47
  • 325

coderforces 706B Interesting drink(二分)

B. Interesting drink time limit per test 2 seconds memory limit per test 256 megabytes ...
  • neversayno_yl
  • neversayno_yl
  • 2016年08月12日 21:31
  • 136

【二分】Codeforces 706B Interesting drink

题目链接:   http://codeforces.com/problemset/problem/706/B 题目大意:   n (1 ≤ n ≤ 100 000)个商店卖一个东西,每个商店的价格Ai...
  • u010568270
  • u010568270
  • 2016年08月16日 23:36
  • 133

【codeforces 706B Interesting drink】+ 二分

Interesting drink B. Interesting drink time limit per test2 seconds memory limit per test256 mega...
  • WYK1823376647
  • WYK1823376647
  • 2016年08月15日 19:06
  • 179

【解题报告】Codeforces Round #367 (Div. 2)

简略的解题报告。
  • TRiddle
  • TRiddle
  • 2016年08月12日 21:37
  • 737

Codeforces 852D Exploration plan [spfa+二分+二分图匹配]

Codeforces 852D Exploration plan [spfa+二分+二分图匹配]
  • ACTerminate
  • ACTerminate
  • 2017年09月19日 20:57
  • 296

codeforces 676C (尺取法)

C. Vasya and String time limit per test 1 second memory limit per test 256 megabytes ...
  • morejarphone
  • morejarphone
  • 2016年05月26日 10:34
  • 358

CodeForces 631E Product Sum(斜率优化DP+二分|三分)

题意:给出n个数,现在可以移动一个数的位置,现在要使和sigma(ai*i)最大,询问这个最大和。 思路:将一个数向左移动和向右移动是一样的,现在考虑向左移动。 先预处理出前缀和,将一个数向左移动...
  • u014664226
  • u014664226
  • 2016年04月01日 19:24
  • 634
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:CodeForces 706B (二分)
举报原因:
原因补充:

(最多只允许输入30个字)