Submission #27824995

---

Source Code Expand

#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
// using P = pair<ll,ll>;

const ll INF = (ll)1e18;
// const int INF = (int)1e9+7;
template<typename T>
void chmin(T &a, T b) { a = min(a, b); }
template<typename T>
void chmax(T &a, T b) { a = max(a, b); }

void solve() {
    int n, q;
    cin >> n >> q;
    vector<int> heights;
    rep(i,n) {
        int a;
        cin >> a;
        heights.push_back(a);
    }

    sort(all(heights));

    rep(i,q) {
        int x;
        cin >> x;
        auto it = lower_bound(all(heights), x);
        int pos = distance(heights.begin(), it);
        cout << n - pos << endl;
    }
}

int main() {
    solve();
    return 0;
}

Submission Info

Judge Result