#pragma region #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace atcoder; using mint = modint1000000007; //using mint = modint998244353; //using mint = modint; using namespace std; typedef long long ll; using vi = vector; using vvi = vector; using vl = vector; using vvl = vector; using pint = pair; using pll = pair; using vpint = vector; using vvpint = vector; using vmint = vector; using vvmint = vector; //#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i)) #define rep(i, e) for (int(i) = 0; (i) < (e); ++(i)) #define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i)) #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #pragma region GCD ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a % b); } #pragma endregion #pragma region LCM ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } #pragma endregion #pragma region chmin template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } #pragma endregion #pragma region chmax template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } #pragma endregion #pragma region グリッド内チェック bool out(int x, int y, int h, int w) { if (x < 0 || h <= x || y < 0 || w <= y)return true; else return false; } #pragma endregion #pragma region Dijkstra vl dijkstra(vector>> v, int s) { ll INF = 1e18; int MAX = 1e6; vl res(MAX, INF); priority_queue, vector>, greater>> q; q.push({ 0,s }); while (!q.empty()) { int now; ll d; tie(d, now) = q.top(); q.pop(); if (!chmin(res[now], d))continue; for (auto p : v[now]) { int next; ll c; tie(next, c) = p; if (res[next] <= res[now] + c)continue; q.push({ res[now] + c,next }); } } return res; } #pragma endregion #pragma endregion int main() { int n; cin >> n; vpint a(n), b(n); rep(i, n) { cin >> a[i].first; a[i].second = i; } rep(i, n) { cin >> b[i].first; b[i].second = i; } sort(all(a)); sort(all(b)); vector> v(n); rep(i, n) { v[i] = { a[i].second,b[i].second,a[i].first }; } sort(rall(v)); fenwick_tree fw(n + 1); set res; rep(i, n) { int g = get<1>(v[i]); int id = get<2>(v[i]); if (fw.sum(0, g) == 0)res.insert(id); fw.add(g, 1); } for (int x : res)cout << x << endl; }