Братски бой

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <queue>


using namespace std;


int main() {
    int n, a;
    cin >> n;
    unordered_map<int, priority_queue<int, vector<int>, greater<>>> stickers;
    for(int i = 0; i < n; i++){
        cin >> a;
        stickers[a].push(i);
    }
    int counter = 0;
    for(int i = 0; i < n; i++){
        cin >> a;
        if(stickers[a].empty() || stickers[a].top() > i)
            counter++;
        else
            stickers[a].pop();
    }
    cout << counter;
    return 0;
}