potok

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <string>
#include <deque>
#include <iomanip>
#include <cstddef>
#include <queue>


using namespace std;

struct edge
{
    int cap, f, from, to;
};

vector<vector<int> > g;
vector<edge> E;
int p[100000], used[100000], d[1000];
int I, S;

void add_edge(int cap, int from, int to)
{
    edge e;
    e.cap = cap;
    e.from = from;
    e.to = to;
    e.f = 0;
    g[from].push_back(E.size());
    E.push_back(e);
}

int dfs(int v, int f)
{
    if (v == S)
        return f;

    if (f <= 0 )
        return 0;

    for (int i = 0; i < g[v].size(); i++)
    {
        int r = g[v][i], to = E[r].to;
        if (d[to] != d[v] + 1)
            continue;

        int f = dfs(to, min(f, E[r].cap - E[r].f));
        if (f > 0)
        {
            E[r].f += f;
            E[r ^ 1].f -= f;
            return f;
        }
    }

    return 0;
}

int inf = 1e9;
queue<int> q;

void bfs()
{
    d[0] = 0;
    q.push(I);
    used[I] = 1;

    while (!q.empty())
    {
        int v = q.front();
        q.pop();

        for (int i = 0; i < g[v].size(); i++)
        {
            int r = g[v][i];
            int to = E[r].to;
            if (!used[to] && E[r].cap > E[r].f)
            {
                q.push(to);
                used[to] = 1;
                d[to] = d[v] + 1;
            }
        }
    }
    return;
}

int main()
{
    ios_base::sync_with_stdio(0);
    freopen("input.txt", "r", stdin);//freopen("output.txt", "w", stdout);
                                     // freopen("slalom.in", "r", stdin);freopen("slalom.out", "w", stdout);
    int n, x;
    cin >> n;

    I = 0;
    S = 2 * n + 1;

    g.resize(S + 1);

    for (int i = 0; i < n; i++)
    {
        cin >> x;
        add_edge(x, I, i + 1);
        add_edge(0, i + 1, I);
    }

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
        {
            add_edge(inf, i + 1, j + 1 + n);
            add_edge(0, j + 1 + n, i + 1);
        }

    for (int i = 0; i < n; i++)
    {
        cin >> x;
        add_edge(x, i + 1 + n, S);
        add_edge(0, S, i + 1 + n);
    }

    int ans = 0;
    while (1)
    {
        for (int i = 0; i <= S; i++)
        {
            used[i] = 0;
            d[i] = inf;
        }

        bfs();


        if (d[S] >= inf)
            break;

        int f;
        for (; ; )
        {
            f = inf;
            f = dfs(I, f);

            ans += f;
            cout << f << endl;
            if (f <= 0)
                break;
        }

    }

    cout << ans << endl;

    return 0;
}