codeforces 706B B. Interesting drink(二分)

题目链接：

B. Interesting drink

题意：

给出第i个商店的价钱为x[i]，现在询问mi能在多少个地方买酒;

思路：

sort后再二分;

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <bits/stdc++.h>
using namespace std;
 
#define For(i,j,n) for(int i=j;i<=n;i++)
#define mst(ss,b) memset(ss,b,sizeof(ss));
 
typedef  long long LL;
 
template<class T> void read(T&num) {
    char CH; bool F=false;
    for(CH=getchar();CH<'0'||CH>'9';F= CH=='-',CH=getchar());
    for(num=0;CH>='0'&&CH<='9';num=num*10+CH-'0',CH=getchar());
    F && (num=-num);
}
int stk[70], tp;
template<class T> inline void print(T p) {
    if(!p) { puts("0"); return; }
    while(p) stk[++ tp] = p%10, p/=10;
    while(tp) putchar(stk[tp--] + '0');
    putchar('\n');
}
 
const LL mod=998244353;
const double PI=acos(-1.0);
const LL inf=1e18;
const int N=1e5+10;
const int maxn=1e3+10;
const  double eps=1e-4;
 
int n,a[N];
int main()
{
        read(n);
        For(i,1,n)read(a[i]);
        sort(a+1,a+n+1);
        int q,m;
        read(q);
        while(q--)
        {
            read(m);
            int l=1,r=n;
            while(l<=r)
            {
                int mid=(l+r)>>1;
                if(a[mid]<=m)l=mid+1;
                else r=mid-1;
            }
            printf("%d\n",l-1);
        }
        return 0;
}