提出 #60393185

---

ソースコード 拡げる

#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define eb emplace_back
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repn(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = (n) - 1; i >= a; i--)
#define pern(i, a, n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;
typedef vector<int> VI;
typedef vector<PII> VPII;
typedef vector<vector<int>> VVI;

const int N = 210000;
const int M = 1100000;
const int mod = 1e9+7;
const int inf = (int)1e9;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

int n, m, a[N], ans[N];
PII b[N];
int main() {
    IO;
    cin >> n >> m;
    repn(i, 1, n) cin >> a[i];
    repn(i, 1, m) cin >> b[i].fi, b[i].se = i, ans[i] = -1;
    sort(b + 1, b + m + 1);
    reverse(b + 1, b + m + 1);
    int cur = 0;
    repn(i, 1, n) {
        while (cur + 1 <= m && b[cur + 1].fi >= a[i]) {
            cur++;
            ans[b[cur].se] = i;
        }
    }
    repn(i, 1, m) cout << ans[i] << "\n";
    return 0;
}

提出情報

ジャッジ結果