RT，

#include <iostream>

using namespace std;

struct card
{
    int f;
    int p;
    bool used;
}p1[105],p2[105];

int main()
{
    int n,m,r,ans;
    // input and init the card
    cin >> n >> m >> r;
    ans=n;
    for (int i=1;i<=n;i++)
    {
        cin >> p1[i].f;
    } 
    for (int i=1;i<=n;i++)
    {
        cin >> p1[i].p;
    }
    for (int i=1;i<=n;i++)
    {
        cin >> p2[i].f;
    }
    for (int i=1;i<=n;i++)
    {
        cin >> p2[i].p;
    }
    // init done...
    
    // p1 chupai
    // from number one
    for (int nowp1=1;nowp1<=n;nowp1++)
    {
        
        int minp=2147483647,minpid=-1;
        for (int nowp2=1;nowp2<=n;nowp2++)
        {
            if (minp>p2[nowp2].p && p2[nowp2].f == p1[nowp1].f)
            {
                minpid=nowp2;
            }
        }
        if (minpid != -1)
        {
            ans--;
            p2[minpid].used=1;
        }
    }
    cout << ans << endl;


}