Submission #39849234

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>
#define N 110000
using namespace std;
int n, m, a[2][N], ans[2][N];
int main() {
  cin >> n >> m;
  vector<pair<int, int>> v;
  for (int i = 1; i <= n; i++)
    cin >> a[0][i], v.push_back({0, i});
  for (int i = 1; i <= m; i++)
    cin >> a[1][i], v.push_back({1, i});
  sort(v.begin(), v.end(), [&](auto x, auto y) {
    return a[x.first][x.second] < a[y.first][y.second];
  });
  for (int i = 0; i < v.size(); i++) {
    ans[v[i].first][v[i].second] = i + 1;
  }
  for (int i = 1; i <= n; i++)
    cout << ans[0][i] << " ";
  cout << '\n';
  for (int i = 1; i <= m; i++)
    cout << ans[1][i] << " ";
  cout << '\n';
  return 0;
}

Submission Info

Judge Result