CodeForces 706B Interesting drink (二分查找)

时间：2024-06-11 16:37:20

题意：给定 n 个数，然后有 m 个询问，每个询问一个数，问你小于等于这个数的数有多少个。

析：其实很简单么，先排序，然后十分查找，so easy。

代码如下：

#pragma comment(linker, "/STACK:1024000000,1024000000")

#include <cstdio>

#include <string>

#include <cstdlib>

#include <cmath>

#include <iostream>

#include <cstring>

#include <set>

#include <queue>

#include <algorithm>

#include <vector>

#include <map>

#include <cctype>

#include <stack>

using namespace std;

typedef long long LL;

typedef pair<int, int> P;

const int INF = 0x3f3f3f3f;

const double inf = 0x3f3f3f3f3f3f;

const LL LNF = 100000000000000000;

const double PI = acos(-1.0);

const double eps = 1e-8;

const int maxn = 1e5 + 5;

const int mod = 1e9 + 7;

const char *mark = "+-*";

const int dr[] = {-1, 0, 1, 0};

const int dc[] = {0, 1, 0, -1};

int n, m;

inline bool is_in(int r, int c){

    return r >= 0 && r < n && c >= 0 && c < m;

}

inline LL Max(LL a, LL b){  return a < b ? b : a; }

inline LL Min(LL a, LL b){  return a > b ? b : a; }

int a[maxn];

int main(){

    while(scanf("%d", &n) == 1){

        for(int i = 0; i < n; ++i)  scanf("%d", &a[i]);

        sort(a, a+n);

        scanf("%d", &m);

        while(m--){

            int x;

            scanf("%d", &x);

            printf("%d\n", upper_bound(a, a+n, x) - a);

        }

    }

    return 0;

}

相关文章