3050. 链表整理

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int t;
    cin >> t;
    for (int i = 0; i < t;i++){
        map<int, int> mp;
        int a1, a2, x;
        cin >> a1 >> a2;
        int p[a1];
        for (int j = 0; j < a1;j++)
            cin >> p[j];
        for (int j = 0; j < a2;j++){
            cin >> x;
            mp[x] = 1;
        }
        printf("case #%d:\n", i);
        bool flag = true;
        for (int j = 0; j < a1;j++){
            if(!mp[p[j]]){
                if(flag){
                    flag = false;
                    cout << p[j];
                }
                else
                    cout << " " << p[j];
            }
        }
        cout << endl;
    }
    return 0;
}