Submission #40079452

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <tuple>
#include <unordered_map>
#define x first
#define y second
#define speedup (ios::sync_with_stdio(0), cin.tie(0), cout.tie(0))
#define INF 0x3f3f3f3f
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;

const int N = 2e5 + 10;

int a[N], b[N], c[N];

int main()
{
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i ++)
    {
        cin >> a[i];
        c[i] = a[i];
    }
    for(int i = 1; i <= m; i ++)
    {
        cin >> b[i];
        c[i + n] = b[i];
    }
    sort(c + 1, c + n + m + 1);
    for(int i = 1; i <= n; i ++)
    {
        cout << (lower_bound(c + 1, c + n + m + 1, a[i]) - c) << ' ';
    }
    cout << endl;
    for(int i = 1; i <= m; i ++)
    {
        cout << (lower_bound(c + 1, c + n + m + 1, b[i]) - c) << ' ';
    }
    return 0;
}

Submission Info

Judge Result